./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:37:09,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:37:09,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:37:09,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:37:09,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:37:09,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:37:09,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:37:09,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:37:09,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:37:09,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:37:09,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:37:09,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:37:09,950 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:37:09,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:37:09,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:37:09,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:37:09,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:09,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:37:09,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:37:09,954 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-03-14 01:37:10,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:37:10,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:37:10,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:37:10,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:37:10,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:37:10,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-14 01:37:11,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30ac4cc4/b3d9ad3ee57a4522ab66a77f205022d2/FLAG91718969f [2025-03-14 01:37:11,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:37:11,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-14 01:37:11,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30ac4cc4/b3d9ad3ee57a4522ab66a77f205022d2/FLAG91718969f [2025-03-14 01:37:11,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30ac4cc4/b3d9ad3ee57a4522ab66a77f205022d2 [2025-03-14 01:37:11,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:37:11,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:37:11,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:11,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:37:11,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:37:11,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:11" (1/1) ... [2025-03-14 01:37:11,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f121fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:11, skipping insertion in model container [2025-03-14 01:37:11,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:11" (1/1) ... [2025-03-14 01:37:11,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:37:12,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:12,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:37:12,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:12,437 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:37:12,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12 WrapperNode [2025-03-14 01:37:12,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:12,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:12,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:37:12,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:37:12,444 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:37:12" (1/1) ... [2025-03-14 01:37:12,465 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:37:12" (1/1) ... [2025-03-14 01:37:12,503 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-03-14 01:37:12,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:12,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:37:12,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:37:12,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:37:12,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:37:12,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:37:12,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:37:12,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:37:12,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (1/1) ... [2025-03-14 01:37:12,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:12,587 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:37:12,601 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:37:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:37:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:37:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:37:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:37:12,614 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:37:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:37:12,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:37:12,615 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:37:12,747 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:37:12,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:37:13,263 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:37:13,264 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:37:13,264 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:37:13,288 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:37:13,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:13 BoogieIcfgContainer [2025-03-14 01:37:13,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:37:13,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:37:13,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:37:13,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:37:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:37:11" (1/3) ... [2025-03-14 01:37:13,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5488b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:13, skipping insertion in model container [2025-03-14 01:37:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:12" (2/3) ... [2025-03-14 01:37:13,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5488b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:13, skipping insertion in model container [2025-03-14 01:37:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:13" (3/3) ... [2025-03-14 01:37:13,297 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-14 01:37:13,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:37:13,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 334 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-14 01:37:13,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:37:13,402 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:37:13,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 337 transitions, 678 flow [2025-03-14 01:37:13,549 INFO L124 PetriNetUnfolderBase]: 4/336 cut-off events. [2025-03-14 01:37:13,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:13,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 336 events. 4/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 413 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 208. Up to 2 conditions per place. [2025-03-14 01:37:13,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 337 transitions, 678 flow [2025-03-14 01:37:13,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 336 transitions, 675 flow [2025-03-14 01:37:13,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:37:13,587 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;@3aa6156c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:37:13,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-14 01:37:13,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:37:13,608 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2025-03-14 01:37:13,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:13,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:13,609 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] [2025-03-14 01:37:13,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:13,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1208132073, now seen corresponding path program 1 times [2025-03-14 01:37:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857987088] [2025-03-14 01:37:13,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:13,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-14 01:37:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-14 01:37:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:13,982 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:37:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857987088] [2025-03-14 01:37:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857987088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:13,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780169528] [2025-03-14 01:37:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:13,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:14,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:14,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:14,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-14 01:37:14,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 336 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:37:14,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:14,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-14 01:37:14,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:14,126 INFO L124 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-03-14 01:37:14,126 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:14,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 414 events. 8/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 890 event pairs, 6 based on Foata normal form. 5/388 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-14 01:37:14,128 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 10 selfloop transitions, 2 changer transitions 1/335 dead transitions. [2025-03-14 01:37:14,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 697 flow [2025-03-14 01:37:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2025-03-14 01:37:14,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9762611275964391 [2025-03-14 01:37:14,143 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 675 flow. Second operand 3 states and 987 transitions. [2025-03-14 01:37:14,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 697 flow [2025-03-14 01:37:14,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:14,154 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 680 flow [2025-03-14 01:37:14,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-03-14 01:37:14,160 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 2 predicate places. [2025-03-14 01:37:14,160 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 680 flow [2025-03-14 01:37:14,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:37:14,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:14,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:37:14,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 332863575, now seen corresponding path program 1 times [2025-03-14 01:37:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585191031] [2025-03-14 01:37:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:14,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:37:14,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:37:14,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:14,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:14,365 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:37:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585191031] [2025-03-14 01:37:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585191031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423700925] [2025-03-14 01:37:14,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:14,368 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:37:14,370 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:37:14,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:37:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:37:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:14,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:14,533 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:37:14,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:14,570 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:37:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423700925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:14,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010255445] [2025-03-14 01:37:14,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:14,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:14,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:14,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:14,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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:37:14,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:14,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:14,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:14,736 INFO L124 PetriNetUnfolderBase]: 8/420 cut-off events. [2025-03-14 01:37:14,736 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 420 events. 8/420 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 879 event pairs, 6 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-03-14 01:37:14,739 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-03-14 01:37:14,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 342 transitions, 744 flow [2025-03-14 01:37:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-14 01:37:14,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-14 01:37:14,745 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 680 flow. Second operand 9 states and 2914 transitions. [2025-03-14 01:37:14,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 342 transitions, 744 flow [2025-03-14 01:37:14,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:14,750 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 728 flow [2025-03-14 01:37:14,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2025-03-14 01:37:14,751 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-14 01:37:14,751 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 728 flow [2025-03-14 01:37:14,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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:37:14,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:14,753 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] [2025-03-14 01:37:14,760 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:37:14,957 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:37:14,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:14,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1914851241, now seen corresponding path program 2 times [2025-03-14 01:37:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962868697] [2025-03-14 01:37:14,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:14,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-14 01:37:14,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-03-14 01:37:14,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:14,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:15,392 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:37:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:15,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962868697] [2025-03-14 01:37:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962868697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701840500] [2025-03-14 01:37:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:15,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:15,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:15,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-14 01:37:15,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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:37:15,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:15,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-14 01:37:15,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:16,133 INFO L124 PetriNetUnfolderBase]: 366/1695 cut-off events. [2025-03-14 01:37:16,133 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:37:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 1695 events. 366/1695 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10149 event pairs, 364 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 2426. Up to 800 conditions per place. [2025-03-14 01:37:16,143 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/338 dead transitions. [2025-03-14 01:37:16,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 338 transitions, 886 flow [2025-03-14 01:37:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-14 01:37:16,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-14 01:37:16,148 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 728 flow. Second operand 6 states and 1595 transitions. [2025-03-14 01:37:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 338 transitions, 886 flow [2025-03-14 01:37:16,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 338 transitions, 880 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:16,154 INFO L231 Difference]: Finished difference. Result has 349 places, 338 transitions, 738 flow [2025-03-14 01:37:16,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=349, PETRI_TRANSITIONS=338} [2025-03-14 01:37:16,155 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 13 predicate places. [2025-03-14 01:37:16,156 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 338 transitions, 738 flow [2025-03-14 01:37:16,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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:37:16,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:16,157 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] [2025-03-14 01:37:16,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:37:16,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:16,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -613763684, now seen corresponding path program 1 times [2025-03-14 01:37:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369616055] [2025-03-14 01:37:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:16,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-14 01:37:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-14 01:37:16,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:16,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:16,224 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:37:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369616055] [2025-03-14 01:37:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369616055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720624326] [2025-03-14 01:37:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:16,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:16,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:16,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-14 01:37:16,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 338 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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:37:16,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:16,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-14 01:37:16,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:16,333 INFO L124 PetriNetUnfolderBase]: 8/529 cut-off events. [2025-03-14 01:37:16,333 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:16,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 529 events. 8/529 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 871 event pairs, 6 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-03-14 01:37:16,335 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 10 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-14 01:37:16,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 339 transitions, 764 flow [2025-03-14 01:37:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-14 01:37:16,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9742828882294757 [2025-03-14 01:37:16,337 INFO L175 Difference]: Start difference. First operand has 349 places, 338 transitions, 738 flow. Second operand 3 states and 985 transitions. [2025-03-14 01:37:16,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 339 transitions, 764 flow [2025-03-14 01:37:16,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:16,341 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 730 flow [2025-03-14 01:37:16,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=347, PETRI_TRANSITIONS=339} [2025-03-14 01:37:16,342 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-14 01:37:16,342 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 730 flow [2025-03-14 01:37:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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:37:16,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:16,343 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, 1, 1, 1] [2025-03-14 01:37:16,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:37:16,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:16,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1974247377, now seen corresponding path program 1 times [2025-03-14 01:37:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951573385] [2025-03-14 01:37:16,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:16,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-14 01:37:16,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-14 01:37:16,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:16,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:16,503 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:37:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951573385] [2025-03-14 01:37:16,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951573385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851679715] [2025-03-14 01:37:16,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:16,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:16,505 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:37:16,507 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:37:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-14 01:37:16,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-14 01:37:16,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:16,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:16,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:16,645 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:37:16,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:16,725 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:37:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851679715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:16,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:16,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:37:16,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965328107] [2025-03-14 01:37:16,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:16,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:37:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:16,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:37:16,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:37:16,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:16,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 339 transitions, 730 flow. Second operand has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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:37:16,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:16,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:16,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:16,978 INFO L124 PetriNetUnfolderBase]: 8/549 cut-off events. [2025-03-14 01:37:16,979 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:37:16,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 549 events. 8/549 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 868 event pairs, 6 based on Foata normal form. 4/519 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-03-14 01:37:16,981 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 18 selfloop transitions, 21 changer transitions 0/357 dead transitions. [2025-03-14 01:37:16,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 357 transitions, 896 flow [2025-03-14 01:37:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:37:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:37:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-14 01:37:16,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-14 01:37:16,992 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 730 flow. Second operand 21 states and 6784 transitions. [2025-03-14 01:37:16,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 357 transitions, 896 flow [2025-03-14 01:37:16,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 357 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:16,998 INFO L231 Difference]: Finished difference. Result has 371 places, 352 transitions, 858 flow [2025-03-14 01:37:16,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=858, PETRI_PLACES=371, PETRI_TRANSITIONS=352} [2025-03-14 01:37:16,999 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 35 predicate places. [2025-03-14 01:37:16,999 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 352 transitions, 858 flow [2025-03-14 01:37:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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:37:17,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:17,002 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, 1] [2025-03-14 01:37:17,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:37:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:17,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1033277487, now seen corresponding path program 2 times [2025-03-14 01:37:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277702291] [2025-03-14 01:37:17,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:17,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-14 01:37:17,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 140 statements. [2025-03-14 01:37:17,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:17,523 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:37:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277702291] [2025-03-14 01:37:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277702291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375495135] [2025-03-14 01:37:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:17,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:17,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:17,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:17,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-14 01:37:17,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 352 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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:37:17,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:17,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-14 01:37:17,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:18,211 INFO L124 PetriNetUnfolderBase]: 366/1822 cut-off events. [2025-03-14 01:37:18,211 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 01:37:18,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1822 events. 366/1822 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10071 event pairs, 364 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 2581. Up to 830 conditions per place. [2025-03-14 01:37:18,219 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-03-14 01:37:18,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 350 transitions, 1016 flow [2025-03-14 01:37:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-14 01:37:18,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-14 01:37:18,224 INFO L175 Difference]: Start difference. First operand has 371 places, 352 transitions, 858 flow. Second operand 6 states and 1595 transitions. [2025-03-14 01:37:18,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 350 transitions, 1016 flow [2025-03-14 01:37:18,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 350 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:37:18,230 INFO L231 Difference]: Finished difference. Result has 368 places, 350 transitions, 850 flow [2025-03-14 01:37:18,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=850, PETRI_PLACES=368, PETRI_TRANSITIONS=350} [2025-03-14 01:37:18,231 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 32 predicate places. [2025-03-14 01:37:18,232 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 350 transitions, 850 flow [2025-03-14 01:37:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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:37:18,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:18,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:18,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:37:18,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:18,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 565403644, now seen corresponding path program 1 times [2025-03-14 01:37:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542706795] [2025-03-14 01:37:18,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:37:18,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:37:18,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:18,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:18,534 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:37:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542706795] [2025-03-14 01:37:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542706795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168563296] [2025-03-14 01:37:18,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:18,537 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:37:18,539 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:37:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:37:18,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:37:18,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:18,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:18,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:18,725 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:37:18,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:18,894 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:37:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168563296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:18,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:18,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:37:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387079010] [2025-03-14 01:37:18,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:18,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:37:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:18,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:37:18,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:37:18,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:18,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 350 transitions, 850 flow. Second operand has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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:37:18,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:18,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:18,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:19,224 INFO L124 PetriNetUnfolderBase]: 8/560 cut-off events. [2025-03-14 01:37:19,227 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-14 01:37:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 560 events. 8/560 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 854 event pairs, 6 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-03-14 01:37:19,230 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 21 selfloop transitions, 30 changer transitions 0/367 dead transitions. [2025-03-14 01:37:19,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 367 transitions, 1074 flow [2025-03-14 01:37:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:37:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:37:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-14 01:37:19,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-14 01:37:19,243 INFO L175 Difference]: Start difference. First operand has 368 places, 350 transitions, 850 flow. Second operand 30 states and 9684 transitions. [2025-03-14 01:37:19,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 367 transitions, 1074 flow [2025-03-14 01:37:19,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 367 transitions, 1054 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:19,250 INFO L231 Difference]: Finished difference. Result has 396 places, 360 transitions, 982 flow [2025-03-14 01:37:19,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=396, PETRI_TRANSITIONS=360} [2025-03-14 01:37:19,251 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 60 predicate places. [2025-03-14 01:37:19,252 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 982 flow [2025-03-14 01:37:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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:37:19,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:19,255 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] [2025-03-14 01:37:19,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:37:19,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:19,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:19,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -470579780, now seen corresponding path program 2 times [2025-03-14 01:37:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482838821] [2025-03-14 01:37:19,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:19,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-14 01:37:19,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 167 statements. [2025-03-14 01:37:19,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:19,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:19,758 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:37:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482838821] [2025-03-14 01:37:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482838821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:19,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987294671] [2025-03-14 01:37:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:19,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:19,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:19,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:20,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 337 [2025-03-14 01:37:20,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 360 transitions, 982 flow. Second operand has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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:37:20,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:20,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 337 [2025-03-14 01:37:20,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:20,598 INFO L124 PetriNetUnfolderBase]: 392/1925 cut-off events. [2025-03-14 01:37:20,598 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-14 01:37:20,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 1925 events. 392/1925 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10787 event pairs, 390 based on Foata normal form. 0/1793 useless extension candidates. Maximal degree in co-relation 2732. Up to 899 conditions per place. [2025-03-14 01:37:20,603 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 83 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-03-14 01:37:20,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 359 transitions, 1156 flow [2025-03-14 01:37:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-14 01:37:20,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-03-14 01:37:20,606 INFO L175 Difference]: Start difference. First operand has 396 places, 360 transitions, 982 flow. Second operand 6 states and 1570 transitions. [2025-03-14 01:37:20,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 359 transitions, 1156 flow [2025-03-14 01:37:20,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1110 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-14 01:37:20,612 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-03-14 01:37:20,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-03-14 01:37:20,613 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 46 predicate places. [2025-03-14 01:37:20,613 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-03-14 01:37:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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:37:20,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:20,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:37:20,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1154900424, now seen corresponding path program 1 times [2025-03-14 01:37:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848092224] [2025-03-14 01:37:20,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:20,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:37:20,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:37:20,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:20,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:21,098 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:37:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848092224] [2025-03-14 01:37:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848092224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:21,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:21,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960665906] [2025-03-14 01:37:21,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:21,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:21,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:21,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:21,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 337 [2025-03-14 01:37:21,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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:37:21,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:21,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 337 [2025-03-14 01:37:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:21,818 INFO L124 PetriNetUnfolderBase]: 56/799 cut-off events. [2025-03-14 01:37:21,819 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-14 01:37:21,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 799 events. 56/799 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2633 event pairs, 54 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-03-14 01:37:21,822 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 57 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-03-14 01:37:21,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1066 flow [2025-03-14 01:37:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-03-14 01:37:21,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407517309594461 [2025-03-14 01:37:21,825 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1700 transitions. [2025-03-14 01:37:21,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1066 flow [2025-03-14 01:37:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1056 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:21,830 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-03-14 01:37:21,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-03-14 01:37:21,831 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 45 predicate places. [2025-03-14 01:37:21,831 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-03-14 01:37:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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:37:21,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:21,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:37:21,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 14038114, now seen corresponding path program 1 times [2025-03-14 01:37:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663546721] [2025-03-14 01:37:21,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:21,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:37:21,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:37:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:22,219 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:37:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663546721] [2025-03-14 01:37:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663546721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:22,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426795336] [2025-03-14 01:37:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:22,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:22,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:22,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-14 01:37:22,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:37:22,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:22,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-14 01:37:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:22,762 INFO L124 PetriNetUnfolderBase]: 38/714 cut-off events. [2025-03-14 01:37:22,762 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-14 01:37:22,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 714 events. 38/714 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2090 event pairs, 36 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-03-14 01:37:22,765 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 53 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-14 01:37:22,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1056 flow [2025-03-14 01:37:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2025-03-14 01:37:22,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481701285855588 [2025-03-14 01:37:22,767 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1715 transitions. [2025-03-14 01:37:22,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1056 flow [2025-03-14 01:37:22,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1046 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:22,772 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-03-14 01:37:22,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-03-14 01:37:22,772 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 44 predicate places. [2025-03-14 01:37:22,773 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-03-14 01:37:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:37:22,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:22,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:37:22,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1162808924, now seen corresponding path program 1 times [2025-03-14 01:37:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034015557] [2025-03-14 01:37:22,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:22,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-14 01:37:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-14 01:37:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:23,167 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:37:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034015557] [2025-03-14 01:37:23,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034015557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:23,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:23,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117749635] [2025-03-14 01:37:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:23,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:23,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:23,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 337 [2025-03-14 01:37:23,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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:37:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:23,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 337 [2025-03-14 01:37:23,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:23,568 INFO L124 PetriNetUnfolderBase]: 366/1829 cut-off events. [2025-03-14 01:37:23,569 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-14 01:37:23,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 1829 events. 366/1829 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10003 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2594. Up to 846 conditions per place. [2025-03-14 01:37:23,575 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-14 01:37:23,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 356 transitions, 1106 flow [2025-03-14 01:37:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2025-03-14 01:37:23,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838773491592482 [2025-03-14 01:37:23,579 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 6 states and 1585 transitions. [2025-03-14 01:37:23,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 356 transitions, 1106 flow [2025-03-14 01:37:23,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 356 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:23,584 INFO L231 Difference]: Finished difference. Result has 379 places, 356 transitions, 938 flow [2025-03-14 01:37:23,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=379, PETRI_TRANSITIONS=356} [2025-03-14 01:37:23,585 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 43 predicate places. [2025-03-14 01:37:23,585 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 356 transitions, 938 flow [2025-03-14 01:37:23,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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:37:23,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:23,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:37:23,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:23,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1435550399, now seen corresponding path program 1 times [2025-03-14 01:37:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357599024] [2025-03-14 01:37:23,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-14 01:37:23,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-14 01:37:23,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:23,971 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:37:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357599024] [2025-03-14 01:37:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357599024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:23,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841501291] [2025-03-14 01:37:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:23,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:23,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:23,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:24,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 337 [2025-03-14 01:37:24,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 356 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:24,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:24,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 337 [2025-03-14 01:37:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:24,377 INFO L124 PetriNetUnfolderBase]: 366/1827 cut-off events. [2025-03-14 01:37:24,377 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-14 01:37:24,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1827 events. 366/1827 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9974 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2590. Up to 844 conditions per place. [2025-03-14 01:37:24,385 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 78 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-14 01:37:24,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 355 transitions, 1102 flow [2025-03-14 01:37:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-03-14 01:37:24,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7863501483679525 [2025-03-14 01:37:24,387 INFO L175 Difference]: Start difference. First operand has 379 places, 356 transitions, 938 flow. Second operand 6 states and 1590 transitions. [2025-03-14 01:37:24,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 355 transitions, 1102 flow [2025-03-14 01:37:24,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 355 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:24,392 INFO L231 Difference]: Finished difference. Result has 378 places, 355 transitions, 936 flow [2025-03-14 01:37:24,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=378, PETRI_TRANSITIONS=355} [2025-03-14 01:37:24,394 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 42 predicate places. [2025-03-14 01:37:24,394 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 355 transitions, 936 flow [2025-03-14 01:37:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:24,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:24,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:37:24,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash -28368906, now seen corresponding path program 1 times [2025-03-14 01:37:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:24,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819855765] [2025-03-14 01:37:24,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:24,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-14 01:37:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-14 01:37:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-14 01:37:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819855765] [2025-03-14 01:37:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819855765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390736442] [2025-03-14 01:37:24,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:24,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:24,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:24,514 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:37:24,515 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:37:24,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-14 01:37:24,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-14 01:37:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:24,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:24,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-14 01:37:24,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-14 01:37:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390736442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:24,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801885535] [2025-03-14 01:37:24,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:24,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:24,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:24,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:25,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:25,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 355 transitions, 936 flow. Second operand has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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:37:25,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:25,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:25,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:25,191 INFO L124 PetriNetUnfolderBase]: 8/657 cut-off events. [2025-03-14 01:37:25,191 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-14 01:37:25,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 657 events. 8/657 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-03-14 01:37:25,194 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2025-03-14 01:37:25,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 363 transitions, 1000 flow [2025-03-14 01:37:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-14 01:37:25,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-14 01:37:25,199 INFO L175 Difference]: Start difference. First operand has 378 places, 355 transitions, 936 flow. Second operand 9 states and 2914 transitions. [2025-03-14 01:37:25,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 363 transitions, 1000 flow [2025-03-14 01:37:25,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 363 transitions, 990 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:25,205 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 976 flow [2025-03-14 01:37:25,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=976, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-03-14 01:37:25,205 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 48 predicate places. [2025-03-14 01:37:25,205 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 976 flow [2025-03-14 01:37:25,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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:37:25,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:25,207 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-14 01:37:25,213 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:37:25,407 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:37:25,407 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1373252938, now seen corresponding path program 2 times [2025-03-14 01:37:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040759593] [2025-03-14 01:37:25,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:25,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-14 01:37:25,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 463 statements. [2025-03-14 01:37:25,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:25,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-14 01:37:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040759593] [2025-03-14 01:37:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040759593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:25,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964357230] [2025-03-14 01:37:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:25,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:25,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:26,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-14 01:37:26,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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:37:26,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:26,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-14 01:37:26,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:26,555 INFO L124 PetriNetUnfolderBase]: 258/1984 cut-off events. [2025-03-14 01:37:26,555 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-14 01:37:26,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1984 events. 258/1984 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10203 event pairs, 36 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 2536. Up to 491 conditions per place. [2025-03-14 01:37:26,563 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 67 selfloop transitions, 70 changer transitions 0/439 dead transitions. [2025-03-14 01:37:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 1406 flow [2025-03-14 01:37:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-14 01:37:26,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-14 01:37:26,564 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 976 flow. Second operand 6 states and 1794 transitions. [2025-03-14 01:37:26,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 1406 flow [2025-03-14 01:37:26,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 439 transitions, 1400 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:26,570 INFO L231 Difference]: Finished difference. Result has 393 places, 430 transitions, 1432 flow [2025-03-14 01:37:26,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1432, PETRI_PLACES=393, PETRI_TRANSITIONS=430} [2025-03-14 01:37:26,571 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 57 predicate places. [2025-03-14 01:37:26,571 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 430 transitions, 1432 flow [2025-03-14 01:37:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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:37:26,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:26,572 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-14 01:37:26,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:37:26,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:26,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash -296968099, now seen corresponding path program 1 times [2025-03-14 01:37:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:26,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454310553] [2025-03-14 01:37:26,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:26,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-14 01:37:26,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-14 01:37:26,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:26,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-14 01:37:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454310553] [2025-03-14 01:37:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454310553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078495355] [2025-03-14 01:37:26,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:26,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:26,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:26,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:26,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:37:27,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-14 01:37:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-14 01:37:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:27,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:27,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-14 01:37:27,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-14 01:37:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078495355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:27,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:37:27,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388781154] [2025-03-14 01:37:27,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:27,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:37:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:27,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:37:27,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:37:27,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:27,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 430 transitions, 1432 flow. Second operand has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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:37:27,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:27,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:27,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:28,461 INFO L124 PetriNetUnfolderBase]: 121/2050 cut-off events. [2025-03-14 01:37:28,462 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-03-14 01:37:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 2050 events. 121/2050 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7281 event pairs, 21 based on Foata normal form. 4/1967 useless extension candidates. Maximal degree in co-relation 2597. Up to 206 conditions per place. [2025-03-14 01:37:28,477 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 19 selfloop transitions, 21 changer transitions 0/448 dead transitions. [2025-03-14 01:37:28,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 448 transitions, 1600 flow [2025-03-14 01:37:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:37:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:37:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-14 01:37:28,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-14 01:37:28,483 INFO L175 Difference]: Start difference. First operand has 393 places, 430 transitions, 1432 flow. Second operand 21 states and 6784 transitions. [2025-03-14 01:37:28,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 448 transitions, 1600 flow [2025-03-14 01:37:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 448 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:28,495 INFO L231 Difference]: Finished difference. Result has 418 places, 443 transitions, 1562 flow [2025-03-14 01:37:28,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1562, PETRI_PLACES=418, PETRI_TRANSITIONS=443} [2025-03-14 01:37:28,496 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 82 predicate places. [2025-03-14 01:37:28,496 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 443 transitions, 1562 flow [2025-03-14 01:37:28,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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:37:28,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:28,500 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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:37:28,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:37:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:37:28,700 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:28,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1319917021, now seen corresponding path program 2 times [2025-03-14 01:37:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817569250] [2025-03-14 01:37:28,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:28,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 889 statements into 2 equivalence classes. [2025-03-14 01:37:28,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 889 statements. [2025-03-14 01:37:28,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-03-14 01:37:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817569250] [2025-03-14 01:37:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817569250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474555340] [2025-03-14 01:37:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:28,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:29,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-14 01:37:29,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 443 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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:37:29,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:29,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-14 01:37:29,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:29,947 INFO L124 PetriNetUnfolderBase]: 501/3119 cut-off events. [2025-03-14 01:37:29,947 INFO L125 PetriNetUnfolderBase]: For 973/1038 co-relation queries the response was YES. [2025-03-14 01:37:29,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5520 conditions, 3119 events. 501/3119 cut-off events. For 973/1038 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16116 event pairs, 92 based on Foata normal form. 16/2978 useless extension candidates. Maximal degree in co-relation 5260. Up to 981 conditions per place. [2025-03-14 01:37:29,958 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 131 selfloop transitions, 130 changer transitions 0/580 dead transitions. [2025-03-14 01:37:29,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 580 transitions, 2734 flow [2025-03-14 01:37:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-03-14 01:37:29,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867457962413452 [2025-03-14 01:37:29,961 INFO L175 Difference]: Start difference. First operand has 418 places, 443 transitions, 1562 flow. Second operand 6 states and 1793 transitions. [2025-03-14 01:37:29,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 580 transitions, 2734 flow [2025-03-14 01:37:29,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 580 transitions, 2710 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:37:29,972 INFO L231 Difference]: Finished difference. Result has 422 places, 572 transitions, 2766 flow [2025-03-14 01:37:29,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2766, PETRI_PLACES=422, PETRI_TRANSITIONS=572} [2025-03-14 01:37:29,973 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 86 predicate places. [2025-03-14 01:37:29,973 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 572 transitions, 2766 flow [2025-03-14 01:37:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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:37:29,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:29,974 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:37:29,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -752290828, now seen corresponding path program 1 times [2025-03-14 01:37:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545259310] [2025-03-14 01:37:29,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-14 01:37:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-14 01:37:30,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:30,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-14 01:37:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545259310] [2025-03-14 01:37:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545259310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725406724] [2025-03-14 01:37:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:31,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:31,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:37:31,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-14 01:37:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-14 01:37:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:31,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:31,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-14 01:37:32,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-14 01:37:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725406724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:32,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:37:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696610800] [2025-03-14 01:37:32,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:32,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:37:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:32,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:37:32,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:37:33,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-14 01:37:33,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 572 transitions, 2766 flow. Second operand has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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:37:33,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:33,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-14 01:37:33,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,089 INFO L124 PetriNetUnfolderBase]: 382/3130 cut-off events. [2025-03-14 01:37:34,089 INFO L125 PetriNetUnfolderBase]: For 1290/1329 co-relation queries the response was YES. [2025-03-14 01:37:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 3130 events. 382/3130 cut-off events. For 1290/1329 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13204 event pairs, 37 based on Foata normal form. 7/3029 useless extension candidates. Maximal degree in co-relation 5160. Up to 467 conditions per place. [2025-03-14 01:37:34,102 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 22 selfloop transitions, 30 changer transitions 0/589 dead transitions. [2025-03-14 01:37:34,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 589 transitions, 2992 flow [2025-03-14 01:37:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:37:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:37:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-14 01:37:34,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-14 01:37:34,109 INFO L175 Difference]: Start difference. First operand has 422 places, 572 transitions, 2766 flow. Second operand 30 states and 9684 transitions. [2025-03-14 01:37:34,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 589 transitions, 2992 flow [2025-03-14 01:37:34,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 589 transitions, 2992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:34,123 INFO L231 Difference]: Finished difference. Result has 455 places, 582 transitions, 2918 flow [2025-03-14 01:37:34,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2918, PETRI_PLACES=455, PETRI_TRANSITIONS=582} [2025-03-14 01:37:34,124 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 119 predicate places. [2025-03-14 01:37:34,124 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 582 transitions, 2918 flow [2025-03-14 01:37:34,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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:37:34,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:34,126 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-14 01:37:34,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:37:34,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:37:34,326 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1447337510, now seen corresponding path program 2 times [2025-03-14 01:37:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323557266] [2025-03-14 01:37:34,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:34,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1214 statements into 2 equivalence classes. [2025-03-14 01:37:34,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1214 statements. [2025-03-14 01:37:34,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:34,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-14 01:37:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:34,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323557266] [2025-03-14 01:37:34,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323557266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:34,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:34,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119388938] [2025-03-14 01:37:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:34,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:34,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:34,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:34,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-14 01:37:34,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 582 transitions, 2918 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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:37:34,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-14 01:37:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:36,161 INFO L124 PetriNetUnfolderBase]: 777/4205 cut-off events. [2025-03-14 01:37:36,161 INFO L125 PetriNetUnfolderBase]: For 3406/3570 co-relation queries the response was YES. [2025-03-14 01:37:36,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 4205 events. 777/4205 cut-off events. For 3406/3570 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22244 event pairs, 65 based on Foata normal form. 52/4092 useless extension candidates. Maximal degree in co-relation 8603. Up to 1323 conditions per place. [2025-03-14 01:37:36,176 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 251 selfloop transitions, 131 changer transitions 5/720 dead transitions. [2025-03-14 01:37:36,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 720 transitions, 4592 flow [2025-03-14 01:37:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-14 01:37:36,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-14 01:37:36,177 INFO L175 Difference]: Start difference. First operand has 455 places, 582 transitions, 2918 flow. Second operand 6 states and 1794 transitions. [2025-03-14 01:37:36,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 720 transitions, 4592 flow [2025-03-14 01:37:36,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 720 transitions, 4546 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-14 01:37:36,191 INFO L231 Difference]: Finished difference. Result has 447 places, 710 transitions, 4352 flow [2025-03-14 01:37:36,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2872, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4352, PETRI_PLACES=447, PETRI_TRANSITIONS=710} [2025-03-14 01:37:36,192 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 111 predicate places. [2025-03-14 01:37:36,192 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 710 transitions, 4352 flow [2025-03-14 01:37:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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:37:36,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:36,193 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-14 01:37:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:37:36,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1730056866, now seen corresponding path program 1 times [2025-03-14 01:37:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585419569] [2025-03-14 01:37:36,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-03-14 01:37:36,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-03-14 01:37:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-14 01:37:39,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585419569] [2025-03-14 01:37:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585419569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664402993] [2025-03-14 01:37:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:39,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:39,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:39,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:39,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 337 [2025-03-14 01:37:39,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 710 transitions, 4352 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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:37:39,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:39,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 337 [2025-03-14 01:37:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:40,786 INFO L124 PetriNetUnfolderBase]: 1309/5603 cut-off events. [2025-03-14 01:37:40,786 INFO L125 PetriNetUnfolderBase]: For 4983/5040 co-relation queries the response was YES. [2025-03-14 01:37:40,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 5603 events. 1309/5603 cut-off events. For 4983/5040 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33851 event pairs, 369 based on Foata normal form. 11/5369 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-03-14 01:37:40,816 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 316 selfloop transitions, 84 changer transitions 0/789 dead transitions. [2025-03-14 01:37:40,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 789 transitions, 5550 flow [2025-03-14 01:37:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1672 transitions. [2025-03-14 01:37:40,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269040553907022 [2025-03-14 01:37:40,819 INFO L175 Difference]: Start difference. First operand has 447 places, 710 transitions, 4352 flow. Second operand 6 states and 1672 transitions. [2025-03-14 01:37:40,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 789 transitions, 5550 flow [2025-03-14 01:37:40,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 789 transitions, 5296 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:40,841 INFO L231 Difference]: Finished difference. Result has 456 places, 781 transitions, 4888 flow [2025-03-14 01:37:40,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4888, PETRI_PLACES=456, PETRI_TRANSITIONS=781} [2025-03-14 01:37:40,842 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 120 predicate places. [2025-03-14 01:37:40,842 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 781 transitions, 4888 flow [2025-03-14 01:37:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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:37:40,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:40,843 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1] [2025-03-14 01:37:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:37:40,844 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:40,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1349632936, now seen corresponding path program 1 times [2025-03-14 01:37:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640711931] [2025-03-14 01:37:40,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:40,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-14 01:37:42,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-14 01:37:42,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 1759 proven. 4363 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-14 01:38:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:15,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640711931] [2025-03-14 01:38:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640711931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:15,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355898649] [2025-03-14 01:38:15,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:15,078 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:15,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:38:15,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-14 01:38:16,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-14 01:38:16,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:16,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:16,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-14 01:38:16,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:17,353 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-14 01:38:17,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-14 01:38:17,820 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-14 01:38:17,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-14 01:38:18,541 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-14 01:38:18,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-14 01:38:18,877 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-14 01:38:18,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-14 01:38:19,593 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-14 01:38:19,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-14 01:38:19,907 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-14 01:38:19,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-14 01:38:20,953 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-14 01:38:20,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-14 01:38:21,813 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-14 01:38:21,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-14 01:38:23,423 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-14 01:38:23,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-14 01:38:24,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-14 01:38:25,034 INFO L349 Elim1Store]: treesize reduction 118, result has 33.0 percent of original size [2025-03-14 01:38:25,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 76 [2025-03-14 01:38:25,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 35 [2025-03-14 01:38:25,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 35 [2025-03-14 01:38:26,766 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 71 treesize of output 29 [2025-03-14 01:38:28,632 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-14 01:38:28,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-14 01:38:29,640 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-14 01:38:29,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-14 01:38:31,707 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-14 01:38:31,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-14 01:38:32,769 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-14 01:38:32,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-14 01:38:34,706 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-14 01:38:34,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64