./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.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 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:35:26,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:27,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:27,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:27,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:27,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:27,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:27,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:27,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:27,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:27,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:27,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:27,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:27,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:27,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:27,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:27,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:27,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:27,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:27,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:27,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:27,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:27,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:27,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:27,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:27,076 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-03-14 01:35:27,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:27,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:27,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:27,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:27,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:27,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-14 01:35:28,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888703682/8de47a36a0bc4547a730fc8ab09fb63b/FLAGa33aaebc1 [2025-03-14 01:35:29,044 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:29,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-14 01:35:29,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888703682/8de47a36a0bc4547a730fc8ab09fb63b/FLAGa33aaebc1 [2025-03-14 01:35:29,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888703682/8de47a36a0bc4547a730fc8ab09fb63b [2025-03-14 01:35:29,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:29,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:29,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:29,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:29,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:29,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111e4196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29, skipping insertion in model container [2025-03-14 01:35:29,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:29,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:29,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:29,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:29,482 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:29,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29 WrapperNode [2025-03-14 01:35:29,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:29,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:29,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:29,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:29,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,526 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-03-14 01:35:29,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:29,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:29,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:29,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:29,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:29,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:29,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:29,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:29,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (1/1) ... [2025-03-14 01:35:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:29,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:29,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:35:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:35:29,614 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:29,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:35:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:35:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:29,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:29,617 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:29,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:29,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:30,035 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:30,035 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:30,035 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:30,057 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:30,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:30 BoogieIcfgContainer [2025-03-14 01:35:30,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:30,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:30,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:30,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:30,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:29" (1/3) ... [2025-03-14 01:35:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40229c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:30, skipping insertion in model container [2025-03-14 01:35:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:29" (2/3) ... [2025-03-14 01:35:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40229c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:30, skipping insertion in model container [2025-03-14 01:35:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:30" (3/3) ... [2025-03-14 01:35:30,064 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-03-14 01:35:30,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:30,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-14 01:35:30,075 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:30,134 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:35:30,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-03-14 01:35:30,247 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-03-14 01:35:30,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:30,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-03-14 01:35:30,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-03-14 01:35:30,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-03-14 01:35:30,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:30,275 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;@787bc657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:30,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 01:35:30,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:30,292 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-03-14 01:35:30,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:30,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:30,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:30,293 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-14 01:35:30,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1531881620, now seen corresponding path program 1 times [2025-03-14 01:35:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701559158] [2025-03-14 01:35:30,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:30,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:35:30,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:35:30,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:30,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:30,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701559158] [2025-03-14 01:35:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701559158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:35:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601024712] [2025-03-14 01:35:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:30,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:30,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:30,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:30,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-03-14 01:35:30,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:30,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:30,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-03-14 01:35:30,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:30,752 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-03-14 01:35:30,752 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:30,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 323 event pairs, 6 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-03-14 01:35:30,756 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-03-14 01:35:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-03-14 01:35:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-03-14 01:35:30,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-03-14 01:35:30,771 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-03-14 01:35:30,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-03-14 01:35:30,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:30,780 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-03-14 01:35:30,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-14 01:35:30,786 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-03-14 01:35:30,786 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-03-14 01:35:30,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:30,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:30,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:30,787 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-14 01:35:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1288320965, now seen corresponding path program 1 times [2025-03-14 01:35:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263561581] [2025-03-14 01:35:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:30,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:35:30,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:35:30,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:30,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:30,996 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-14 01:35:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263561581] [2025-03-14 01:35:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263561581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204235002] [2025-03-14 01:35:30,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:31,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:31,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:35:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:35:31,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:35:31,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:31,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:35:31,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:31,149 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-14 01:35:31,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:31,195 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-14 01:35:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204235002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:31,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:35:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937534127] [2025-03-14 01:35:31,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:35:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:31,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:35:31,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:35:31,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-14 01:35:31,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:31,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:31,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-14 01:35:31,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:31,368 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-03-14 01:35:31,369 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:31,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 227 events. 7/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 318 event pairs, 6 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-03-14 01:35:31,370 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-03-14 01:35:31,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-03-14 01:35:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:35:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:35:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-03-14 01:35:31,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-03-14 01:35:31,377 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-03-14 01:35:31,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-03-14 01:35:31,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:31,380 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-03-14 01:35:31,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=163} [2025-03-14 01:35:31,382 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-03-14 01:35:31,382 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-03-14 01:35:31,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:31,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:31,384 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, 1, 1, 1, 1] [2025-03-14 01:35:31,397 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-14 01:35:31,585 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-14 01:35:31,585 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-14 01:35:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -320842789, now seen corresponding path program 2 times [2025-03-14 01:35:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969214866] [2025-03-14 01:35:31,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:31,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-14 01:35:31,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-03-14 01:35:31,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:32,197 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-14 01:35:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969214866] [2025-03-14 01:35:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969214866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516878356] [2025-03-14 01:35:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:32,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:32,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:32,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:32,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-03-14 01:35:32,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:32,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:32,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-03-14 01:35:32,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:32,788 INFO L124 PetriNetUnfolderBase]: 103/540 cut-off events. [2025-03-14 01:35:32,788 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:35:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 540 events. 103/540 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2314 event pairs, 40 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 693. Up to 184 conditions per place. [2025-03-14 01:35:32,790 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 31 selfloop transitions, 22 changer transitions 0/192 dead transitions. [2025-03-14 01:35:32,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 192 transitions, 538 flow [2025-03-14 01:35:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2025-03-14 01:35:32,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.89375 [2025-03-14 01:35:32,793 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 858 transitions. [2025-03-14 01:35:32,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 192 transitions, 538 flow [2025-03-14 01:35:32,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 192 transitions, 532 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:32,797 INFO L231 Difference]: Finished difference. Result has 180 places, 184 transitions, 518 flow [2025-03-14 01:35:32,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=180, PETRI_TRANSITIONS=184} [2025-03-14 01:35:32,798 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 20 predicate places. [2025-03-14 01:35:32,798 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 184 transitions, 518 flow [2025-03-14 01:35:32,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:32,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:32,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:32,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:35:32,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -78790998, now seen corresponding path program 1 times [2025-03-14 01:35:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174702563] [2025-03-14 01:35:32,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:32,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:35:32,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:35:32,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:32,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:32,974 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-14 01:35:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174702563] [2025-03-14 01:35:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174702563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147205292] [2025-03-14 01:35:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:32,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:32,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:32,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:32,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:35:33,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:35:33,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:35:33,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:33,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:33,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:35:33,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:33,110 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-14 01:35:33,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:33,204 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-14 01:35:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147205292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:33,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:33,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:35:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630794623] [2025-03-14 01:35:33,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:33,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:35:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:35:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:35:33,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-14 01:35:33,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 184 transitions, 518 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:33,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:33,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-14 01:35:33,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:33,432 INFO L124 PetriNetUnfolderBase]: 41/402 cut-off events. [2025-03-14 01:35:33,432 INFO L125 PetriNetUnfolderBase]: For 54/57 co-relation queries the response was YES. [2025-03-14 01:35:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 402 events. 41/402 cut-off events. For 54/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1228 event pairs, 11 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 494. Up to 51 conditions per place. [2025-03-14 01:35:33,436 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-03-14 01:35:33,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 684 flow [2025-03-14 01:35:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:35:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:35:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-03-14 01:35:33,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-03-14 01:35:33,442 INFO L175 Difference]: Start difference. First operand has 180 places, 184 transitions, 518 flow. Second operand 21 states and 3067 transitions. [2025-03-14 01:35:33,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 684 flow [2025-03-14 01:35:33,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:33,450 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 648 flow [2025-03-14 01:35:33,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=648, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-03-14 01:35:33,452 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2025-03-14 01:35:33,452 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 648 flow [2025-03-14 01:35:33,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:33,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:33,454 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, 1, 1, 1, 1] [2025-03-14 01:35:33,460 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-14 01:35:33,658 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-14 01:35:33,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:33,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1783398934, now seen corresponding path program 2 times [2025-03-14 01:35:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933233090] [2025-03-14 01:35:33,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:33,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-14 01:35:33,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-03-14 01:35:33,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:33,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:34,007 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-14 01:35:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933233090] [2025-03-14 01:35:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933233090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646401661] [2025-03-14 01:35:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:34,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:34,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:34,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-03-14 01:35:34,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:34,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:34,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-03-14 01:35:34,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:34,533 INFO L124 PetriNetUnfolderBase]: 223/892 cut-off events. [2025-03-14 01:35:34,533 INFO L125 PetriNetUnfolderBase]: For 190/196 co-relation queries the response was YES. [2025-03-14 01:35:34,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 892 events. 223/892 cut-off events. For 190/196 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4686 event pairs, 82 based on Foata normal form. 5/839 useless extension candidates. Maximal degree in co-relation 1566. Up to 407 conditions per place. [2025-03-14 01:35:34,537 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 53 selfloop transitions, 39 changer transitions 5/242 dead transitions. [2025-03-14 01:35:34,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 242 transitions, 962 flow [2025-03-14 01:35:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-03-14 01:35:34,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2025-03-14 01:35:34,539 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 648 flow. Second operand 6 states and 844 transitions. [2025-03-14 01:35:34,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 242 transitions, 962 flow [2025-03-14 01:35:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 242 transitions, 938 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:35:34,545 INFO L231 Difference]: Finished difference. Result has 209 places, 233 transitions, 912 flow [2025-03-14 01:35:34,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=209, PETRI_TRANSITIONS=233} [2025-03-14 01:35:34,545 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2025-03-14 01:35:34,546 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 233 transitions, 912 flow [2025-03-14 01:35:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:34,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:34,546 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, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:35:34,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:34,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1518349476, now seen corresponding path program 1 times [2025-03-14 01:35:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243179543] [2025-03-14 01:35:34,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:34,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:35:34,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:35:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:34,823 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-14 01:35:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243179543] [2025-03-14 01:35:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243179543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44641164] [2025-03-14 01:35:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:34,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:34,826 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-14 01:35:34,828 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-14 01:35:34,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:35:34,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:35:34,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:34,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:34,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:35:34,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:35,089 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-14 01:35:35,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:35,399 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-14 01:35:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44641164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:35,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:35:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030682621] [2025-03-14 01:35:35,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:35:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:35:35,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:35:35,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-14 01:35:35,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 233 transitions, 912 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:35,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:35,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-14 01:35:35,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:36,188 INFO L124 PetriNetUnfolderBase]: 123/664 cut-off events. [2025-03-14 01:35:36,188 INFO L125 PetriNetUnfolderBase]: For 324/327 co-relation queries the response was YES. [2025-03-14 01:35:36,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 664 events. 123/664 cut-off events. For 324/327 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2932 event pairs, 15 based on Foata normal form. 3/639 useless extension candidates. Maximal degree in co-relation 1133. Up to 118 conditions per place. [2025-03-14 01:35:36,192 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-03-14 01:35:36,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 250 transitions, 1136 flow [2025-03-14 01:35:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:35:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:35:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-03-14 01:35:36,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-03-14 01:35:36,198 INFO L175 Difference]: Start difference. First operand has 209 places, 233 transitions, 912 flow. Second operand 30 states and 4374 transitions. [2025-03-14 01:35:36,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 250 transitions, 1136 flow [2025-03-14 01:35:36,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 250 transitions, 1104 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:36,207 INFO L231 Difference]: Finished difference. Result has 241 places, 243 transitions, 1032 flow [2025-03-14 01:35:36,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1032, PETRI_PLACES=241, PETRI_TRANSITIONS=243} [2025-03-14 01:35:36,209 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 81 predicate places. [2025-03-14 01:35:36,209 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 243 transitions, 1032 flow [2025-03-14 01:35:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:36,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:36,211 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] [2025-03-14 01:35:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:35:36,414 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-14 01:35:36,414 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash 928010101, now seen corresponding path program 2 times [2025-03-14 01:35:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310629935] [2025-03-14 01:35:36,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:36,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-14 01:35:36,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-03-14 01:35:36,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:36,659 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-14 01:35:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310629935] [2025-03-14 01:35:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310629935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11090909] [2025-03-14 01:35:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:36,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:36,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:36,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:36,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-03-14 01:35:36,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 243 transitions, 1032 flow. Second operand has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:36,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:36,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-03-14 01:35:36,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:36,912 INFO L124 PetriNetUnfolderBase]: 212/925 cut-off events. [2025-03-14 01:35:36,912 INFO L125 PetriNetUnfolderBase]: For 576/620 co-relation queries the response was YES. [2025-03-14 01:35:36,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 925 events. 212/925 cut-off events. For 576/620 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4930 event pairs, 40 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 1908. Up to 338 conditions per place. [2025-03-14 01:35:36,917 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 72 selfloop transitions, 40 changer transitions 0/282 dead transitions. [2025-03-14 01:35:36,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 282 transitions, 1440 flow [2025-03-14 01:35:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-03-14 01:35:36,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-14 01:35:36,920 INFO L175 Difference]: Start difference. First operand has 241 places, 243 transitions, 1032 flow. Second operand 6 states and 873 transitions. [2025-03-14 01:35:36,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 282 transitions, 1440 flow [2025-03-14 01:35:36,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 282 transitions, 1394 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-14 01:35:36,927 INFO L231 Difference]: Finished difference. Result has 233 places, 274 transitions, 1354 flow [2025-03-14 01:35:36,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=233, PETRI_TRANSITIONS=274} [2025-03-14 01:35:36,928 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 73 predicate places. [2025-03-14 01:35:36,928 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 274 transitions, 1354 flow [2025-03-14 01:35:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:36,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:36,929 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, 1, 1, 1] [2025-03-14 01:35:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:35:36,929 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-14 01:35:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 590300793, now seen corresponding path program 1 times [2025-03-14 01:35:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117826019] [2025-03-14 01:35:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:36,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-14 01:35:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-14 01:35:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:37,283 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-14 01:35:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117826019] [2025-03-14 01:35:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117826019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:37,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571642620] [2025-03-14 01:35:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:37,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:37,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:37,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-03-14 01:35:37,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 274 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:37,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:37,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-03-14 01:35:37,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:37,643 INFO L124 PetriNetUnfolderBase]: 361/1326 cut-off events. [2025-03-14 01:35:37,644 INFO L125 PetriNetUnfolderBase]: For 1440/1468 co-relation queries the response was YES. [2025-03-14 01:35:37,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1326 events. 361/1326 cut-off events. For 1440/1468 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7957 event pairs, 87 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 3405. Up to 610 conditions per place. [2025-03-14 01:35:37,653 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 100 selfloop transitions, 64 changer transitions 10/335 dead transitions. [2025-03-14 01:35:37,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 335 transitions, 2042 flow [2025-03-14 01:35:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2025-03-14 01:35:37,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947916666666667 [2025-03-14 01:35:37,656 INFO L175 Difference]: Start difference. First operand has 233 places, 274 transitions, 1354 flow. Second operand 6 states and 859 transitions. [2025-03-14 01:35:37,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 335 transitions, 2042 flow [2025-03-14 01:35:37,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 335 transitions, 2024 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:37,673 INFO L231 Difference]: Finished difference. Result has 243 places, 321 transitions, 1922 flow [2025-03-14 01:35:37,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1922, PETRI_PLACES=243, PETRI_TRANSITIONS=321} [2025-03-14 01:35:37,674 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 83 predicate places. [2025-03-14 01:35:37,675 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 321 transitions, 1922 flow [2025-03-14 01:35:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:37,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:37,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:35:37,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:37,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash 845009196, now seen corresponding path program 1 times [2025-03-14 01:35:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323913424] [2025-03-14 01:35:37,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:37,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:35:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:35:37,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:37,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:43,831 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-14 01:35:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323913424] [2025-03-14 01:35:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323913424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:35:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538503740] [2025-03-14 01:35:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:43,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:35:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:43,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:35:43,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:35:46,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-14 01:35:46,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 321 transitions, 1922 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:46,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:46,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-14 01:35:46,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:47,745 INFO L124 PetriNetUnfolderBase]: 461/1566 cut-off events. [2025-03-14 01:35:47,745 INFO L125 PetriNetUnfolderBase]: For 2922/3002 co-relation queries the response was YES. [2025-03-14 01:35:47,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 1566 events. 461/1566 cut-off events. For 2922/3002 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9811 event pairs, 19 based on Foata normal form. 37/1587 useless extension candidates. Maximal degree in co-relation 4896. Up to 562 conditions per place. [2025-03-14 01:35:47,761 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 190 selfloop transitions, 84 changer transitions 47/471 dead transitions. [2025-03-14 01:35:47,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 471 transitions, 3654 flow [2025-03-14 01:35:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:35:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:35:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2298 transitions. [2025-03-14 01:35:47,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7979166666666667 [2025-03-14 01:35:47,766 INFO L175 Difference]: Start difference. First operand has 243 places, 321 transitions, 1922 flow. Second operand 18 states and 2298 transitions. [2025-03-14 01:35:47,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 471 transitions, 3654 flow [2025-03-14 01:35:47,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 471 transitions, 3568 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:47,859 INFO L231 Difference]: Finished difference. Result has 268 places, 358 transitions, 2482 flow [2025-03-14 01:35:47,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2482, PETRI_PLACES=268, PETRI_TRANSITIONS=358} [2025-03-14 01:35:47,859 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2025-03-14 01:35:47,859 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 358 transitions, 2482 flow [2025-03-14 01:35:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:47,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:47,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:47,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:35:47,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash -162561478, now seen corresponding path program 2 times [2025-03-14 01:35:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319750043] [2025-03-14 01:35:47,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:47,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-14 01:35:47,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-14 01:35:47,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:47,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:48,957 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-14 01:35:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319750043] [2025-03-14 01:35:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319750043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:48,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:35:48,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771410063] [2025-03-14 01:35:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:35:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:48,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:35:48,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:35:49,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-14 01:35:49,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 358 transitions, 2482 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:49,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:49,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-14 01:35:49,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:50,234 INFO L124 PetriNetUnfolderBase]: 458/1562 cut-off events. [2025-03-14 01:35:50,234 INFO L125 PetriNetUnfolderBase]: For 4283/4329 co-relation queries the response was YES. [2025-03-14 01:35:50,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 1562 events. 458/1562 cut-off events. For 4283/4329 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9748 event pairs, 44 based on Foata normal form. 19/1562 useless extension candidates. Maximal degree in co-relation 5682. Up to 662 conditions per place. [2025-03-14 01:35:50,248 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 165 selfloop transitions, 80 changer transitions 27/424 dead transitions. [2025-03-14 01:35:50,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 424 transitions, 3515 flow [2025-03-14 01:35:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:35:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:35:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2025-03-14 01:35:50,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8569444444444444 [2025-03-14 01:35:50,251 INFO L175 Difference]: Start difference. First operand has 268 places, 358 transitions, 2482 flow. Second operand 9 states and 1234 transitions. [2025-03-14 01:35:50,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 424 transitions, 3515 flow [2025-03-14 01:35:50,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 424 transitions, 3475 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-14 01:35:50,279 INFO L231 Difference]: Finished difference. Result has 271 places, 359 transitions, 2649 flow [2025-03-14 01:35:50,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2649, PETRI_PLACES=271, PETRI_TRANSITIONS=359} [2025-03-14 01:35:50,281 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2025-03-14 01:35:50,281 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 359 transitions, 2649 flow [2025-03-14 01:35:50,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:50,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:50,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:35:50,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:50,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1799924342, now seen corresponding path program 3 times [2025-03-14 01:35:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:50,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366140488] [2025-03-14 01:35:50,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:35:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:50,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:35:50,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-14 01:35:50,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:35:50,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:50,918 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-14 01:35:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366140488] [2025-03-14 01:35:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366140488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:50,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:35:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137069483] [2025-03-14 01:35:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:35:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:50,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:35:50,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:35:51,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-14 01:35:51,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 359 transitions, 2649 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:51,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:51,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-14 01:35:51,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:52,276 INFO L124 PetriNetUnfolderBase]: 754/2506 cut-off events. [2025-03-14 01:35:52,277 INFO L125 PetriNetUnfolderBase]: For 9076/9204 co-relation queries the response was YES. [2025-03-14 01:35:52,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 2506 events. 754/2506 cut-off events. For 9076/9204 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18783 event pairs, 62 based on Foata normal form. 48/2524 useless extension candidates. Maximal degree in co-relation 9972. Up to 612 conditions per place. [2025-03-14 01:35:52,295 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 329 selfloop transitions, 100 changer transitions 18/603 dead transitions. [2025-03-14 01:35:52,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 603 transitions, 6036 flow [2025-03-14 01:35:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:35:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:35:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1402 transitions. [2025-03-14 01:35:52,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87625 [2025-03-14 01:35:52,297 INFO L175 Difference]: Start difference. First operand has 271 places, 359 transitions, 2649 flow. Second operand 10 states and 1402 transitions. [2025-03-14 01:35:52,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 603 transitions, 6036 flow [2025-03-14 01:35:52,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 603 transitions, 5900 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-14 01:35:52,342 INFO L231 Difference]: Finished difference. Result has 282 places, 439 transitions, 4069 flow [2025-03-14 01:35:52,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4069, PETRI_PLACES=282, PETRI_TRANSITIONS=439} [2025-03-14 01:35:52,343 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2025-03-14 01:35:52,343 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 439 transitions, 4069 flow [2025-03-14 01:35:52,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:52,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:52,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:52,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:35:52,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:52,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1559827944, now seen corresponding path program 4 times [2025-03-14 01:35:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033850590] [2025-03-14 01:35:52,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:35:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:52,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-14 01:35:52,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:35:52,378 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:35:52,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:35:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033850590] [2025-03-14 01:35:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033850590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:35:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719915780] [2025-03-14 01:35:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:35:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:35:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:35:56,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-03-14 01:35:56,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 439 transitions, 4069 flow. Second operand has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:56,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:56,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-03-14 01:35:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:58,152 INFO L124 PetriNetUnfolderBase]: 850/2753 cut-off events. [2025-03-14 01:35:58,152 INFO L125 PetriNetUnfolderBase]: For 12941/13105 co-relation queries the response was YES. [2025-03-14 01:35:58,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12017 conditions, 2753 events. 850/2753 cut-off events. For 12941/13105 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20517 event pairs, 93 based on Foata normal form. 93/2814 useless extension candidates. Maximal degree in co-relation 11721. Up to 1157 conditions per place. [2025-03-14 01:35:58,171 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 225 selfloop transitions, 174 changer transitions 13/561 dead transitions. [2025-03-14 01:35:58,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 561 transitions, 5826 flow [2025-03-14 01:35:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 01:35:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 01:35:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3278 transitions. [2025-03-14 01:35:58,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879807692307692 [2025-03-14 01:35:58,173 INFO L175 Difference]: Start difference. First operand has 282 places, 439 transitions, 4069 flow. Second operand 26 states and 3278 transitions. [2025-03-14 01:35:58,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 561 transitions, 5826 flow [2025-03-14 01:35:58,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 561 transitions, 5798 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:58,223 INFO L231 Difference]: Finished difference. Result has 323 places, 479 transitions, 4979 flow [2025-03-14 01:35:58,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4979, PETRI_PLACES=323, PETRI_TRANSITIONS=479} [2025-03-14 01:35:58,224 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 163 predicate places. [2025-03-14 01:35:58,224 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 479 transitions, 4979 flow [2025-03-14 01:35:58,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:35:58,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:58,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:58,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:35:58,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:58,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:58,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1493938316, now seen corresponding path program 5 times [2025-03-14 01:35:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:58,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832025939] [2025-03-14 01:35:58,226 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:35:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:58,241 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:35:58,282 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:35:58,282 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-14 01:35:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832025939] [2025-03-14 01:36:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832025939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811383703] [2025-03-14 01:36:03,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:36:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:03,656 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-14 01:36:03,657 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-14 01:36:03,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:36:03,780 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:03,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-14 01:36:03,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:03,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-14 01:36:03,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:03,847 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 16 treesize of output 12 [2025-03-14 01:36:03,952 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 15 treesize of output 11 [2025-03-14 01:36:04,020 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-14 01:36:04,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-03-14 01:36:04,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-14 01:36:04,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-03-14 01:36:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-03-14 01:36:04,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:04,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:04,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:04,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:04,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-03-14 01:36:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-14 01:36:04,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:05,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-14 01:36:05,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-03-14 01:36:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811383703] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:05,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:36:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [34, 21] total 49 [2025-03-14 01:36:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787353111] [2025-03-14 01:36:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:05,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:05,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2025-03-14 01:36:07,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-14 01:36:07,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 479 transitions, 4979 flow. Second operand has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:07,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-14 01:36:07,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:10,419 INFO L124 PetriNetUnfolderBase]: 1273/3981 cut-off events. [2025-03-14 01:36:10,419 INFO L125 PetriNetUnfolderBase]: For 25616/25889 co-relation queries the response was YES. [2025-03-14 01:36:10,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19318 conditions, 3981 events. 1273/3981 cut-off events. For 25616/25889 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 32803 event pairs, 50 based on Foata normal form. 115/4069 useless extension candidates. Maximal degree in co-relation 19004. Up to 1053 conditions per place. [2025-03-14 01:36:10,470 INFO L140 encePairwiseOnDemand]: 137/160 looper letters, 374 selfloop transitions, 260 changer transitions 23/820 dead transitions. [2025-03-14 01:36:10,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 820 transitions, 10552 flow [2025-03-14 01:36:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:36:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:36:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2164 transitions. [2025-03-14 01:36:10,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453125 [2025-03-14 01:36:10,472 INFO L175 Difference]: Start difference. First operand has 323 places, 479 transitions, 4979 flow. Second operand 16 states and 2164 transitions. [2025-03-14 01:36:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 820 transitions, 10552 flow [2025-03-14 01:36:10,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 820 transitions, 9904 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:10,677 INFO L231 Difference]: Finished difference. Result has 345 places, 594 transitions, 7452 flow [2025-03-14 01:36:10,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7452, PETRI_PLACES=345, PETRI_TRANSITIONS=594} [2025-03-14 01:36:10,680 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 185 predicate places. [2025-03-14 01:36:10,680 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 594 transitions, 7452 flow [2025-03-14 01:36:10,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:10,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:10,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:10,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:36:10,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:10,881 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:10,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1440220166, now seen corresponding path program 6 times [2025-03-14 01:36:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:10,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640544786] [2025-03-14 01:36:10,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:36:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:10,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:36:10,909 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-14 01:36:10,911 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:36:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640544786] [2025-03-14 01:36:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640544786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:11,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:11,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:36:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955373642] [2025-03-14 01:36:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:11,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:11,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:11,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:36:12,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-14 01:36:12,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 594 transitions, 7452 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:12,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:12,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-14 01:36:12,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:13,879 INFO L124 PetriNetUnfolderBase]: 1331/3982 cut-off events. [2025-03-14 01:36:13,880 INFO L125 PetriNetUnfolderBase]: For 33554/33887 co-relation queries the response was YES. [2025-03-14 01:36:13,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21518 conditions, 3982 events. 1331/3982 cut-off events. For 33554/33887 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 32613 event pairs, 231 based on Foata normal form. 149/4092 useless extension candidates. Maximal degree in co-relation 21192. Up to 1927 conditions per place. [2025-03-14 01:36:13,907 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 248 selfloop transitions, 254 changer transitions 18/683 dead transitions. [2025-03-14 01:36:13,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 683 transitions, 9712 flow [2025-03-14 01:36:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:36:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:36:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1731 transitions. [2025-03-14 01:36:13,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322115384615385 [2025-03-14 01:36:13,909 INFO L175 Difference]: Start difference. First operand has 345 places, 594 transitions, 7452 flow. Second operand 13 states and 1731 transitions. [2025-03-14 01:36:13,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 683 transitions, 9712 flow [2025-03-14 01:36:14,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 683 transitions, 9584 flow, removed 64 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:14,051 INFO L231 Difference]: Finished difference. Result has 362 places, 625 transitions, 8564 flow [2025-03-14 01:36:14,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=7326, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8564, PETRI_PLACES=362, PETRI_TRANSITIONS=625} [2025-03-14 01:36:14,053 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 202 predicate places. [2025-03-14 01:36:14,053 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 625 transitions, 8564 flow [2025-03-14 01:36:14,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:14,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:14,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:14,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:36:14,054 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:14,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1098260644, now seen corresponding path program 7 times [2025-03-14 01:36:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426986170] [2025-03-14 01:36:14,055 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:36:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:36:14,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:22,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426986170] [2025-03-14 01:36:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426986170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:22,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:22,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:36:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772584606] [2025-03-14 01:36:22,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:36:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:22,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:36:22,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:36:24,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-14 01:36:24,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 625 transitions, 8564 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:24,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:24,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-14 01:36:24,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:26,468 INFO L124 PetriNetUnfolderBase]: 1234/3860 cut-off events. [2025-03-14 01:36:26,468 INFO L125 PetriNetUnfolderBase]: For 38890/39148 co-relation queries the response was YES. [2025-03-14 01:36:26,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 3860 events. 1234/3860 cut-off events. For 38890/39148 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 31935 event pairs, 128 based on Foata normal form. 113/3931 useless extension candidates. Maximal degree in co-relation 21414. Up to 1219 conditions per place. [2025-03-14 01:36:26,505 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 446 selfloop transitions, 209 changer transitions 25/841 dead transitions. [2025-03-14 01:36:26,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 841 transitions, 12304 flow [2025-03-14 01:36:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:36:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:36:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2195 transitions. [2025-03-14 01:36:26,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8069852941176471 [2025-03-14 01:36:26,510 INFO L175 Difference]: Start difference. First operand has 362 places, 625 transitions, 8564 flow. Second operand 17 states and 2195 transitions. [2025-03-14 01:36:26,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 841 transitions, 12304 flow [2025-03-14 01:36:26,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 841 transitions, 11995 flow, removed 103 selfloop flow, removed 3 redundant places. [2025-03-14 01:36:26,848 INFO L231 Difference]: Finished difference. Result has 382 places, 659 transitions, 9661 flow [2025-03-14 01:36:26,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8294, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9661, PETRI_PLACES=382, PETRI_TRANSITIONS=659} [2025-03-14 01:36:26,849 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 222 predicate places. [2025-03-14 01:36:26,850 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 659 transitions, 9661 flow [2025-03-14 01:36:26,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:26,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:26,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:36:26,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:26,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 270647720, now seen corresponding path program 8 times [2025-03-14 01:36:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:26,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320212271] [2025-03-14 01:36:26,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:36:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:26,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-14 01:36:26,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-14 01:36:26,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:36:26,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320212271] [2025-03-14 01:36:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320212271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:36:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78280442] [2025-03-14 01:36:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:27,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:27,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:36:28,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-14 01:36:28,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 659 transitions, 9661 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:28,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:28,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-14 01:36:28,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:29,337 INFO L124 PetriNetUnfolderBase]: 1339/4025 cut-off events. [2025-03-14 01:36:29,337 INFO L125 PetriNetUnfolderBase]: For 48943/49197 co-relation queries the response was YES. [2025-03-14 01:36:29,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23997 conditions, 4025 events. 1339/4025 cut-off events. For 48943/49197 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 33165 event pairs, 235 based on Foata normal form. 103/4088 useless extension candidates. Maximal degree in co-relation 23656. Up to 1917 conditions per place. [2025-03-14 01:36:29,364 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 284 selfloop transitions, 280 changer transitions 18/745 dead transitions. [2025-03-14 01:36:29,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 745 transitions, 12190 flow [2025-03-14 01:36:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:36:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:36:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1850 transitions. [2025-03-14 01:36:29,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8258928571428571 [2025-03-14 01:36:29,366 INFO L175 Difference]: Start difference. First operand has 382 places, 659 transitions, 9661 flow. Second operand 14 states and 1850 transitions. [2025-03-14 01:36:29,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 745 transitions, 12190 flow [2025-03-14 01:36:29,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 745 transitions, 11747 flow, removed 111 selfloop flow, removed 7 redundant places. [2025-03-14 01:36:29,564 INFO L231 Difference]: Finished difference. Result has 397 places, 696 transitions, 10812 flow [2025-03-14 01:36:29,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9232, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10812, PETRI_PLACES=397, PETRI_TRANSITIONS=696} [2025-03-14 01:36:29,565 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 237 predicate places. [2025-03-14 01:36:29,565 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 696 transitions, 10812 flow [2025-03-14 01:36:29,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:29,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:29,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:29,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:36:29,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -633155074, now seen corresponding path program 9 times [2025-03-14 01:36:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:29,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320784771] [2025-03-14 01:36:29,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:36:29,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:29,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:36:29,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-14 01:36:29,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:36:29,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320784771] [2025-03-14 01:36:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320784771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:30,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:30,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:36:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123095205] [2025-03-14 01:36:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:30,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:30,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:36:30,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-14 01:36:30,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 696 transitions, 10812 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:30,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:30,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-14 01:36:30,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:32,157 INFO L124 PetriNetUnfolderBase]: 1338/4040 cut-off events. [2025-03-14 01:36:32,157 INFO L125 PetriNetUnfolderBase]: For 52312/52562 co-relation queries the response was YES. [2025-03-14 01:36:32,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24664 conditions, 4040 events. 1338/4040 cut-off events. For 52312/52562 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 33384 event pairs, 129 based on Foata normal form. 101/4099 useless extension candidates. Maximal degree in co-relation 24315. Up to 1345 conditions per place. [2025-03-14 01:36:32,195 INFO L140 encePairwiseOnDemand]: 139/160 looper letters, 451 selfloop transitions, 244 changer transitions 25/883 dead transitions. [2025-03-14 01:36:32,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 883 transitions, 14430 flow [2025-03-14 01:36:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:36:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:36:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1519 transitions. [2025-03-14 01:36:32,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630681818181818 [2025-03-14 01:36:32,197 INFO L175 Difference]: Start difference. First operand has 397 places, 696 transitions, 10812 flow. Second operand 11 states and 1519 transitions. [2025-03-14 01:36:32,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 883 transitions, 14430 flow [2025-03-14 01:36:32,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 883 transitions, 14117 flow, removed 122 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:32,428 INFO L231 Difference]: Finished difference. Result has 412 places, 720 transitions, 11922 flow [2025-03-14 01:36:32,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=10521, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11922, PETRI_PLACES=412, PETRI_TRANSITIONS=720} [2025-03-14 01:36:32,429 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 252 predicate places. [2025-03-14 01:36:32,429 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 720 transitions, 11922 flow [2025-03-14 01:36:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:32,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:32,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:36:32,430 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-14 01:36:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1234555359, now seen corresponding path program 1 times [2025-03-14 01:36:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720340675] [2025-03-14 01:36:32,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:32,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:36:32,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:32,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:32,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720340675] [2025-03-14 01:36:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720340675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:36,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:36,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123246694] [2025-03-14 01:36:36,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:36,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:36,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:37,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-14 01:36:37,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 720 transitions, 11922 flow. Second operand has 13 states, 13 states have (on average 127.53846153846153) internal successors, (1658), 13 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:37,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:37,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-14 01:36:37,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:39,568 INFO L124 PetriNetUnfolderBase]: 1021/3442 cut-off events. [2025-03-14 01:36:39,569 INFO L125 PetriNetUnfolderBase]: For 56799/57160 co-relation queries the response was YES. [2025-03-14 01:36:39,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21910 conditions, 3442 events. 1021/3442 cut-off events. For 56799/57160 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 28928 event pairs, 33 based on Foata normal form. 82/3503 useless extension candidates. Maximal degree in co-relation 21555. Up to 801 conditions per place. [2025-03-14 01:36:39,602 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 429 selfloop transitions, 200 changer transitions 42/893 dead transitions. [2025-03-14 01:36:39,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 893 transitions, 15168 flow [2025-03-14 01:36:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 01:36:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 01:36:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2910 transitions. [2025-03-14 01:36:39,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8267045454545454 [2025-03-14 01:36:39,604 INFO L175 Difference]: Start difference. First operand has 412 places, 720 transitions, 11922 flow. Second operand 22 states and 2910 transitions. [2025-03-14 01:36:39,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 893 transitions, 15168 flow [2025-03-14 01:36:39,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 893 transitions, 14951 flow, removed 69 selfloop flow, removed 3 redundant places. [2025-03-14 01:36:39,874 INFO L231 Difference]: Finished difference. Result has 439 places, 766 transitions, 13092 flow [2025-03-14 01:36:39,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=11745, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=13092, PETRI_PLACES=439, PETRI_TRANSITIONS=766} [2025-03-14 01:36:39,875 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 279 predicate places. [2025-03-14 01:36:39,875 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 766 transitions, 13092 flow [2025-03-14 01:36:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 127.53846153846153) internal successors, (1658), 13 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:39,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:39,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:36:39,876 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:39,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2092056002, now seen corresponding path program 10 times [2025-03-14 01:36:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674842918] [2025-03-14 01:36:39,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:39,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-14 01:36:39,894 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:39,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:36:39,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674842918] [2025-03-14 01:36:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674842918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 01:36:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133910010] [2025-03-14 01:36:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:40,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:36:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:40,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:36:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:36:43,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2025-03-14 01:36:43,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 766 transitions, 13092 flow. Second operand has 15 states, 15 states have (on average 118.8) internal successors, (1782), 15 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:43,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:43,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2025-03-14 01:36:43,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:45,447 INFO L124 PetriNetUnfolderBase]: 1935/5584 cut-off events. [2025-03-14 01:36:45,447 INFO L125 PetriNetUnfolderBase]: For 93265/93578 co-relation queries the response was YES. [2025-03-14 01:36:45,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37552 conditions, 5584 events. 1935/5584 cut-off events. For 93265/93578 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 48150 event pairs, 215 based on Foata normal form. 114/5661 useless extension candidates. Maximal degree in co-relation 37189. Up to 1653 conditions per place. [2025-03-14 01:36:45,519 INFO L140 encePairwiseOnDemand]: 131/160 looper letters, 971 selfloop transitions, 220 changer transitions 12/1348 dead transitions. [2025-03-14 01:36:45,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1348 transitions, 25106 flow [2025-03-14 01:36:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2456 transitions. [2025-03-14 01:36:45,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078947368421052 [2025-03-14 01:36:45,527 INFO L175 Difference]: Start difference. First operand has 439 places, 766 transitions, 13092 flow. Second operand 19 states and 2456 transitions. [2025-03-14 01:36:45,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1348 transitions, 25106 flow [2025-03-14 01:36:46,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 1348 transitions, 24910 flow, removed 25 selfloop flow, removed 11 redundant places. [2025-03-14 01:36:46,020 INFO L231 Difference]: Finished difference. Result has 455 places, 917 transitions, 17674 flow [2025-03-14 01:36:46,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=12965, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17674, PETRI_PLACES=455, PETRI_TRANSITIONS=917} [2025-03-14 01:36:46,021 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 295 predicate places. [2025-03-14 01:36:46,021 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 917 transitions, 17674 flow [2025-03-14 01:36:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.8) internal successors, (1782), 15 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:46,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:46,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:36:46,022 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash -993892860, now seen corresponding path program 11 times [2025-03-14 01:36:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215620772] [2025-03-14 01:36:46,023 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:36:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:46,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:36:46,044 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:46,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-14 01:36:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:36:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215620772] [2025-03-14 01:36:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215620772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:36:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783192818] [2025-03-14 01:36:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:46,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:46,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:36:47,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-14 01:36:47,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 917 transitions, 17674 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:47,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:47,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-14 01:36:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:48,728 INFO L124 PetriNetUnfolderBase]: 1647/5024 cut-off events. [2025-03-14 01:36:48,728 INFO L125 PetriNetUnfolderBase]: For 96857/97243 co-relation queries the response was YES. [2025-03-14 01:36:48,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35343 conditions, 5024 events. 1647/5024 cut-off events. For 96857/97243 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 44386 event pairs, 234 based on Foata normal form. 223/5186 useless extension candidates. Maximal degree in co-relation 34968. Up to 2364 conditions per place. [2025-03-14 01:36:48,786 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 382 selfloop transitions, 379 changer transitions 9/959 dead transitions. [2025-03-14 01:36:48,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 959 transitions, 19840 flow [2025-03-14 01:36:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:36:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:36:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1495 transitions. [2025-03-14 01:36:48,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494318181818182 [2025-03-14 01:36:48,788 INFO L175 Difference]: Start difference. First operand has 455 places, 917 transitions, 17674 flow. Second operand 11 states and 1495 transitions. [2025-03-14 01:36:48,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 959 transitions, 19840 flow [2025-03-14 01:36:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 959 transitions, 19750 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-14 01:36:49,255 INFO L231 Difference]: Finished difference. Result has 464 places, 921 transitions, 18465 flow [2025-03-14 01:36:49,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=17584, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18465, PETRI_PLACES=464, PETRI_TRANSITIONS=921} [2025-03-14 01:36:49,256 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 304 predicate places. [2025-03-14 01:36:49,256 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 921 transitions, 18465 flow [2025-03-14 01:36:49,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:49,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:49,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:36:49,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1650972464, now seen corresponding path program 12 times [2025-03-14 01:36:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108039291] [2025-03-14 01:36:49,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:36:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:49,273 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-14 01:36:49,277 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-03-14 01:36:49,277 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:36:49,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-14 01:36:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108039291] [2025-03-14 01:36:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108039291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:49,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:49,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:36:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413437854] [2025-03-14 01:36:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:36:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:49,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:36:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:36:50,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-14 01:36:50,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 921 transitions, 18465 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:50,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:50,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-14 01:36:50,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:52,350 INFO L124 PetriNetUnfolderBase]: 1664/5089 cut-off events. [2025-03-14 01:36:52,351 INFO L125 PetriNetUnfolderBase]: For 106325/106696 co-relation queries the response was YES. [2025-03-14 01:36:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36929 conditions, 5089 events. 1664/5089 cut-off events. For 106325/106696 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 45123 event pairs, 131 based on Foata normal form. 171/5201 useless extension candidates. Maximal degree in co-relation 36589. Up to 1808 conditions per place. [2025-03-14 01:36:52,396 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 496 selfloop transitions, 368 changer transitions 9/1062 dead transitions. [2025-03-14 01:36:52,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1062 transitions, 22199 flow [2025-03-14 01:36:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:36:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:36:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1514 transitions. [2025-03-14 01:36:52,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602272727272727 [2025-03-14 01:36:52,398 INFO L175 Difference]: Start difference. First operand has 464 places, 921 transitions, 18465 flow. Second operand 11 states and 1514 transitions. [2025-03-14 01:36:52,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1062 transitions, 22199 flow [2025-03-14 01:36:52,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1062 transitions, 21401 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-14 01:36:52,909 INFO L231 Difference]: Finished difference. Result has 470 places, 949 transitions, 19430 flow [2025-03-14 01:36:52,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=17725, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19430, PETRI_PLACES=470, PETRI_TRANSITIONS=949} [2025-03-14 01:36:52,910 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 310 predicate places. [2025-03-14 01:36:52,910 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 949 transitions, 19430 flow [2025-03-14 01:36:52,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:52,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:52,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:52,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:36:52,911 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:36:52,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash -577393004, now seen corresponding path program 13 times [2025-03-14 01:36:52,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:52,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802499029] [2025-03-14 01:36:52,912 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:36:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:52,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:36:52,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:52,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:52,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat