./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/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-?-f8ab0bd-m [2025-03-13 22:17:30,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:17:30,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:17:30,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:17:30,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:17:30,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:17:30,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:17:30,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:17:30,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:17:30,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:17:30,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:17:30,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:17:30,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:17:30,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:17:30,492 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:17:30,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:17:30,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:30,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:17:30,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:17:30,494 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-13 22:17:30,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:17:30,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:17:30,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:17:30,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:17:30,708 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:17:30,709 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-13 22:17:31,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b1d02d9/ac78b4f6c73b4a7896ba5f7a62faee1d/FLAGba35c52cb [2025-03-13 22:17:32,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:17:32,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-13 22:17:32,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b1d02d9/ac78b4f6c73b4a7896ba5f7a62faee1d/FLAGba35c52cb [2025-03-13 22:17:32,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b1d02d9/ac78b4f6c73b4a7896ba5f7a62faee1d [2025-03-13 22:17:32,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:17:32,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:17:32,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:32,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:17:32,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:17:32,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:32" (1/1) ... [2025-03-13 22:17:32,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7910510b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:32, skipping insertion in model container [2025-03-13 22:17:32,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:32" (1/1) ... [2025-03-13 22:17:32,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:17:33,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:33,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:17:33,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:33,150 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:17:33,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33 WrapperNode [2025-03-13 22:17:33,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:33,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:33,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:17:33,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:17:33,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,207 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-03-13 22:17:33,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:33,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:17:33,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:17:33,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:17:33,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:17:33,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:17:33,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:17:33,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:17:33,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (1/1) ... [2025-03-13 22:17:33,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:33,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:33,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:17:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:17:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:17:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:17:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:17:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:17:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:17:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:17:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:17:33,321 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:17:33,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:17:33,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:17:33,936 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:17:33,939 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:17:33,939 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:17:33,972 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:17:33,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:33 BoogieIcfgContainer [2025-03-13 22:17:33,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:17:33,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:17:33,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:17:33,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:17:33,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:17:32" (1/3) ... [2025-03-13 22:17:33,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aec3416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:33, skipping insertion in model container [2025-03-13 22:17:33,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:33" (2/3) ... [2025-03-13 22:17:33,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aec3416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:33, skipping insertion in model container [2025-03-13 22:17:33,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:33" (3/3) ... [2025-03-13 22:17:33,982 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-13 22:17:33,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:17:33,997 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-13 22:17:33,997 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:17:34,079 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:17:34,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 337 transitions, 678 flow [2025-03-13 22:17:34,207 INFO L124 PetriNetUnfolderBase]: 4/336 cut-off events. [2025-03-13 22:17:34,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:34,213 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-13 22:17:34,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 337 transitions, 678 flow [2025-03-13 22:17:34,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 336 transitions, 675 flow [2025-03-13 22:17:34,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:17:34,240 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;@24f63ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:17:34,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 22:17:34,264 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:17:34,264 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2025-03-13 22:17:34,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:34,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:34,266 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-13 22:17:34,266 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-13 22:17:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1208132073, now seen corresponding path program 1 times [2025-03-13 22:17:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235731664] [2025-03-13 22:17:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:34,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:17:34,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:17:34,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:34,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235731664] [2025-03-13 22:17:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235731664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:34,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277446021] [2025-03-13 22:17:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:34,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:34,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-13 22:17:34,621 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-13 22:17:34,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:34,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-13 22:17:34,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:34,702 INFO L124 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-03-13 22:17:34,702 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:34,703 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-13 22:17:34,704 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 10 selfloop transitions, 2 changer transitions 1/335 dead transitions. [2025-03-13 22:17:34,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 697 flow [2025-03-13 22:17:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2025-03-13 22:17:34,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9762611275964391 [2025-03-13 22:17:34,720 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 675 flow. Second operand 3 states and 987 transitions. [2025-03-13 22:17:34,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 697 flow [2025-03-13 22:17:34,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:34,732 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 680 flow [2025-03-13 22:17:34,734 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-13 22:17:34,738 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 2 predicate places. [2025-03-13 22:17:34,738 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 680 flow [2025-03-13 22:17:34,738 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-13 22:17:34,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:34,739 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-13 22:17:34,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:17:34,739 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-13 22:17:34,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 332863575, now seen corresponding path program 1 times [2025-03-13 22:17:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144042330] [2025-03-13 22:17:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:34,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:17:34,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:17:34,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:34,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144042330] [2025-03-13 22:17:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144042330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060652064] [2025-03-13 22:17:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:34,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:34,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:34,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:17:35,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:17:35,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:17:35,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:35,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:35,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:35,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:35,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060652064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:35,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112285069] [2025-03-13 22:17:35,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:35,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:35,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:35,214 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-13 22:17:35,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:35,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:35,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:35,330 INFO L124 PetriNetUnfolderBase]: 8/420 cut-off events. [2025-03-13 22:17:35,330 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:35,331 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-13 22:17:35,332 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-03-13 22:17:35,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 342 transitions, 744 flow [2025-03-13 22:17:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-13 22:17:35,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-13 22:17:35,339 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 680 flow. Second operand 9 states and 2914 transitions. [2025-03-13 22:17:35,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 342 transitions, 744 flow [2025-03-13 22:17:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:35,343 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 728 flow [2025-03-13 22:17:35,344 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-13 22:17:35,344 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-13 22:17:35,345 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 728 flow [2025-03-13 22:17:35,346 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-13 22:17:35,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:35,346 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-13 22:17:35,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:17:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:35,551 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-13 22:17:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1914851241, now seen corresponding path program 2 times [2025-03-13 22:17:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376524871] [2025-03-13 22:17:35,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:35,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-13 22:17:35,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-03-13 22:17:35,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:35,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:17:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376524871] [2025-03-13 22:17:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376524871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451257049] [2025-03-13 22:17:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:36,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:36,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:36,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:36,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-13 22:17:36,462 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-13 22:17:36,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:36,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-13 22:17:36,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:36,783 INFO L124 PetriNetUnfolderBase]: 366/1695 cut-off events. [2025-03-13 22:17:36,783 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:17:36,788 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-13 22:17:36,793 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/338 dead transitions. [2025-03-13 22:17:36,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 338 transitions, 886 flow [2025-03-13 22:17:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-13 22:17:36,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-13 22:17:36,797 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 728 flow. Second operand 6 states and 1595 transitions. [2025-03-13 22:17:36,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 338 transitions, 886 flow [2025-03-13 22:17:36,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 338 transitions, 880 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:36,801 INFO L231 Difference]: Finished difference. Result has 349 places, 338 transitions, 738 flow [2025-03-13 22:17:36,802 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-13 22:17:36,802 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 13 predicate places. [2025-03-13 22:17:36,803 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 338 transitions, 738 flow [2025-03-13 22:17:36,803 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-13 22:17:36,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:36,804 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-13 22:17:36,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:17:36,804 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-13 22:17:36,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -613763684, now seen corresponding path program 1 times [2025-03-13 22:17:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458766942] [2025-03-13 22:17:36,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:17:36,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:17:36,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:17:36,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:36,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458766942] [2025-03-13 22:17:36,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458766942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:36,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:36,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360091494] [2025-03-13 22:17:36,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:36,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:36,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:36,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-13 22:17:36,903 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-13 22:17:36,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:36,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-13 22:17:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:36,961 INFO L124 PetriNetUnfolderBase]: 8/529 cut-off events. [2025-03-13 22:17:36,961 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:17:36,962 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-13 22:17:36,964 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 10 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-13 22:17:36,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 339 transitions, 764 flow [2025-03-13 22:17:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-13 22:17:36,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9742828882294757 [2025-03-13 22:17:36,966 INFO L175 Difference]: Start difference. First operand has 349 places, 338 transitions, 738 flow. Second operand 3 states and 985 transitions. [2025-03-13 22:17:36,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 339 transitions, 764 flow [2025-03-13 22:17:36,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:36,972 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 730 flow [2025-03-13 22:17:36,972 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-13 22:17:36,973 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-13 22:17:36,973 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 730 flow [2025-03-13 22:17:36,974 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-13 22:17:36,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:36,974 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-13 22:17:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:17:36,974 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-13 22:17:36,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1974247377, now seen corresponding path program 1 times [2025-03-13 22:17:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:36,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51036987] [2025-03-13 22:17:36,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:36,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:17:37,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:17:37,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:37,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51036987] [2025-03-13 22:17:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51036987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106224528] [2025-03-13 22:17:37,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:37,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:37,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:37,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:17:37,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:17:37,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:17:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:37,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:37,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:37,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:37,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106224528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:37,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793850187] [2025-03-13 22:17:37,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:37,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:37,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:37,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:37,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:37,399 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-13 22:17:37,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:37,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:37,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:37,606 INFO L124 PetriNetUnfolderBase]: 8/549 cut-off events. [2025-03-13 22:17:37,607 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:17:37,607 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-13 22:17:37,608 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 18 selfloop transitions, 21 changer transitions 0/357 dead transitions. [2025-03-13 22:17:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 357 transitions, 896 flow [2025-03-13 22:17:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-13 22:17:37,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-13 22:17:37,618 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 730 flow. Second operand 21 states and 6784 transitions. [2025-03-13 22:17:37,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 357 transitions, 896 flow [2025-03-13 22:17:37,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 357 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:37,624 INFO L231 Difference]: Finished difference. Result has 371 places, 352 transitions, 858 flow [2025-03-13 22:17:37,624 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-13 22:17:37,625 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 35 predicate places. [2025-03-13 22:17:37,625 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 352 transitions, 858 flow [2025-03-13 22:17:37,628 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-13 22:17:37,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:37,628 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-13 22:17:37,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 22:17:37,829 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-13 22:17:37,830 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-13 22:17:37,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1033277487, now seen corresponding path program 2 times [2025-03-13 22:17:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019569954] [2025-03-13 22:17:37,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:37,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-13 22:17:37,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 140 statements. [2025-03-13 22:17:37,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-13 22:17:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019569954] [2025-03-13 22:17:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019569954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397251573] [2025-03-13 22:17:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:38,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:38,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:38,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-13 22:17:38,513 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-13 22:17:38,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:38,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-13 22:17:38,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:38,849 INFO L124 PetriNetUnfolderBase]: 366/1822 cut-off events. [2025-03-13 22:17:38,849 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:17:38,853 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-13 22:17:38,857 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-03-13 22:17:38,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 350 transitions, 1016 flow [2025-03-13 22:17:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-13 22:17:38,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-13 22:17:38,860 INFO L175 Difference]: Start difference. First operand has 371 places, 352 transitions, 858 flow. Second operand 6 states and 1595 transitions. [2025-03-13 22:17:38,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 350 transitions, 1016 flow [2025-03-13 22:17:38,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 350 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:38,866 INFO L231 Difference]: Finished difference. Result has 368 places, 350 transitions, 850 flow [2025-03-13 22:17:38,866 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-13 22:17:38,867 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 32 predicate places. [2025-03-13 22:17:38,867 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 350 transitions, 850 flow [2025-03-13 22:17:38,867 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-13 22:17:38,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:38,868 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-13 22:17:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:17:38,868 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-13 22:17:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 565403644, now seen corresponding path program 1 times [2025-03-13 22:17:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959027019] [2025-03-13 22:17:38,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:38,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-13 22:17:38,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 22:17:38,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959027019] [2025-03-13 22:17:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959027019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379422293] [2025-03-13 22:17:39,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:39,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:39,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:17:39,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-13 22:17:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 22:17:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:39,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:39,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:39,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:39,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379422293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:39,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815906898] [2025-03-13 22:17:39,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:39,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:39,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:39,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:39,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:39,497 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-13 22:17:39,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:39,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:39,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:39,764 INFO L124 PetriNetUnfolderBase]: 8/560 cut-off events. [2025-03-13 22:17:39,764 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-13 22:17:39,765 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-13 22:17:39,766 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 21 selfloop transitions, 30 changer transitions 0/367 dead transitions. [2025-03-13 22:17:39,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 367 transitions, 1074 flow [2025-03-13 22:17:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-13 22:17:39,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-13 22:17:39,779 INFO L175 Difference]: Start difference. First operand has 368 places, 350 transitions, 850 flow. Second operand 30 states and 9684 transitions. [2025-03-13 22:17:39,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 367 transitions, 1074 flow [2025-03-13 22:17:39,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 367 transitions, 1054 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:39,784 INFO L231 Difference]: Finished difference. Result has 396 places, 360 transitions, 982 flow [2025-03-13 22:17:39,784 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-13 22:17:39,785 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 60 predicate places. [2025-03-13 22:17:39,785 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 982 flow [2025-03-13 22:17:39,787 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-13 22:17:39,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:39,787 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-13 22:17:39,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:39,987 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-13 22:17:39,988 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-13 22:17:39,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -470579780, now seen corresponding path program 2 times [2025-03-13 22:17:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109685290] [2025-03-13 22:17:39,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:40,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-13 22:17:40,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 167 statements. [2025-03-13 22:17:40,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:40,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109685290] [2025-03-13 22:17:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109685290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089410569] [2025-03-13 22:17:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:40,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:40,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:40,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 337 [2025-03-13 22:17:40,792 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-13 22:17:40,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:40,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 337 [2025-03-13 22:17:40,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:41,054 INFO L124 PetriNetUnfolderBase]: 392/1925 cut-off events. [2025-03-13 22:17:41,055 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-13 22:17:41,057 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-13 22:17:41,061 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 83 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-03-13 22:17:41,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 359 transitions, 1156 flow [2025-03-13 22:17:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-13 22:17:41,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-03-13 22:17:41,065 INFO L175 Difference]: Start difference. First operand has 396 places, 360 transitions, 982 flow. Second operand 6 states and 1570 transitions. [2025-03-13 22:17:41,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 359 transitions, 1156 flow [2025-03-13 22:17:41,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1110 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:41,070 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-03-13 22:17:41,071 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-13 22:17:41,071 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 46 predicate places. [2025-03-13 22:17:41,071 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-03-13 22:17:41,072 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-13 22:17:41,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:41,072 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-13 22:17:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:17:41,072 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-13 22:17:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1154900424, now seen corresponding path program 1 times [2025-03-13 22:17:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109908203] [2025-03-13 22:17:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-13 22:17:41,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-13 22:17:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:41,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109908203] [2025-03-13 22:17:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109908203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143539002] [2025-03-13 22:17:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:41,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:41,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:42,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 337 [2025-03-13 22:17:42,060 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-13 22:17:42,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:42,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 337 [2025-03-13 22:17:42,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:42,211 INFO L124 PetriNetUnfolderBase]: 56/799 cut-off events. [2025-03-13 22:17:42,211 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-13 22:17:42,212 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-13 22:17:42,214 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 57 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-03-13 22:17:42,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1066 flow [2025-03-13 22:17:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-03-13 22:17:42,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407517309594461 [2025-03-13 22:17:42,218 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1700 transitions. [2025-03-13 22:17:42,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1066 flow [2025-03-13 22:17:42,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1056 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:42,226 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-03-13 22:17:42,226 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-13 22:17:42,227 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 45 predicate places. [2025-03-13 22:17:42,228 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-03-13 22:17:42,228 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-13 22:17:42,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:42,228 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-13 22:17:42,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:17:42,229 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-13 22:17:42,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash 14038114, now seen corresponding path program 1 times [2025-03-13 22:17:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:42,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048500169] [2025-03-13 22:17:42,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:42,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-13 22:17:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-13 22:17:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:42,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048500169] [2025-03-13 22:17:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048500169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:42,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169241291] [2025-03-13 22:17:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:42,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:42,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:42,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:43,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-13 22:17:43,121 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-13 22:17:43,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:43,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-13 22:17:43,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:43,196 INFO L124 PetriNetUnfolderBase]: 38/714 cut-off events. [2025-03-13 22:17:43,197 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:43,198 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-13 22:17:43,199 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 53 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-13 22:17:43,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1056 flow [2025-03-13 22:17:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2025-03-13 22:17:43,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481701285855588 [2025-03-13 22:17:43,202 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1715 transitions. [2025-03-13 22:17:43,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1056 flow [2025-03-13 22:17:43,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1046 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:43,208 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-03-13 22:17:43,209 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-13 22:17:43,210 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 44 predicate places. [2025-03-13 22:17:43,210 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-03-13 22:17:43,211 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-13 22:17:43,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:43,211 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:43,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:17:43,211 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-13 22:17:43,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1162808924, now seen corresponding path program 1 times [2025-03-13 22:17:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474852257] [2025-03-13 22:17:43,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:17:43,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:17:43,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:43,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474852257] [2025-03-13 22:17:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474852257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:43,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:43,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784449061] [2025-03-13 22:17:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:43,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:43,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:43,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:43,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 337 [2025-03-13 22:17:43,831 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-13 22:17:43,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:43,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 337 [2025-03-13 22:17:43,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:44,012 INFO L124 PetriNetUnfolderBase]: 366/1829 cut-off events. [2025-03-13 22:17:44,012 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:44,015 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-13 22:17:44,046 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-13 22:17:44,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 356 transitions, 1106 flow [2025-03-13 22:17:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2025-03-13 22:17:44,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838773491592482 [2025-03-13 22:17:44,049 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 6 states and 1585 transitions. [2025-03-13 22:17:44,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 356 transitions, 1106 flow [2025-03-13 22:17:44,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 356 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:44,054 INFO L231 Difference]: Finished difference. Result has 379 places, 356 transitions, 938 flow [2025-03-13 22:17:44,056 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-13 22:17:44,057 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 43 predicate places. [2025-03-13 22:17:44,057 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 356 transitions, 938 flow [2025-03-13 22:17:44,058 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-13 22:17:44,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:44,059 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-13 22:17:44,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:17:44,059 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-13 22:17:44,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1435550399, now seen corresponding path program 1 times [2025-03-13 22:17:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526756766] [2025-03-13 22:17:44,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:44,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-13 22:17:44,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-13 22:17:44,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:44,515 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-13 22:17:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526756766] [2025-03-13 22:17:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526756766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89686071] [2025-03-13 22:17:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:44,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:44,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 337 [2025-03-13 22:17:44,740 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-13 22:17:44,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:44,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 337 [2025-03-13 22:17:44,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:44,915 INFO L124 PetriNetUnfolderBase]: 366/1827 cut-off events. [2025-03-13 22:17:44,916 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:44,919 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-13 22:17:44,923 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 78 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-13 22:17:44,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 355 transitions, 1102 flow [2025-03-13 22:17:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-03-13 22:17:44,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7863501483679525 [2025-03-13 22:17:44,926 INFO L175 Difference]: Start difference. First operand has 379 places, 356 transitions, 938 flow. Second operand 6 states and 1590 transitions. [2025-03-13 22:17:44,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 355 transitions, 1102 flow [2025-03-13 22:17:44,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 355 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:44,931 INFO L231 Difference]: Finished difference. Result has 378 places, 355 transitions, 936 flow [2025-03-13 22:17:44,931 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-13 22:17:44,933 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 42 predicate places. [2025-03-13 22:17:44,934 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 355 transitions, 936 flow [2025-03-13 22:17:44,934 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-13 22:17:44,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:44,934 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-13 22:17:44,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:17:44,935 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-13 22:17:44,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -28368906, now seen corresponding path program 1 times [2025-03-13 22:17:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170026211] [2025-03-13 22:17:44,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-13 22:17:44,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-13 22:17:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:45,058 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-13 22:17:45,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170026211] [2025-03-13 22:17:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170026211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669791796] [2025-03-13 22:17:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:45,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:45,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:45,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:17:45,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-13 22:17:45,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-13 22:17:45,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:45,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:45,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:45,348 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-13 22:17:45,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:45,463 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-13 22:17:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669791796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:45,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457200854] [2025-03-13 22:17:45,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:45,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:45,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:45,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:45,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:45,554 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-13 22:17:45,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:45,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:45,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:45,663 INFO L124 PetriNetUnfolderBase]: 8/657 cut-off events. [2025-03-13 22:17:45,663 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-13 22:17:45,664 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-13 22:17:45,665 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2025-03-13 22:17:45,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 363 transitions, 1000 flow [2025-03-13 22:17:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-13 22:17:45,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-13 22:17:45,667 INFO L175 Difference]: Start difference. First operand has 378 places, 355 transitions, 936 flow. Second operand 9 states and 2914 transitions. [2025-03-13 22:17:45,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 363 transitions, 1000 flow [2025-03-13 22:17:45,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 363 transitions, 990 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:45,673 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 976 flow [2025-03-13 22:17:45,673 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-13 22:17:45,674 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 48 predicate places. [2025-03-13 22:17:45,674 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 976 flow [2025-03-13 22:17:45,675 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-13 22:17:45,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:45,675 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-13 22:17:45,682 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-13 22:17:45,875 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-13 22:17:45,876 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-13 22:17:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1373252938, now seen corresponding path program 2 times [2025-03-13 22:17:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187062860] [2025-03-13 22:17:45,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:45,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-13 22:17:45,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 463 statements. [2025-03-13 22:17:45,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:46,095 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-13 22:17:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187062860] [2025-03-13 22:17:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187062860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542081086] [2025-03-13 22:17:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:46,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:46,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:46,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-13 22:17:46,583 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-13 22:17:46,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:46,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-13 22:17:46,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:46,987 INFO L124 PetriNetUnfolderBase]: 258/1984 cut-off events. [2025-03-13 22:17:46,988 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-13 22:17:46,990 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-13 22:17:46,993 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 67 selfloop transitions, 70 changer transitions 0/439 dead transitions. [2025-03-13 22:17:46,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 1406 flow [2025-03-13 22:17:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-13 22:17:46,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-13 22:17:46,995 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 976 flow. Second operand 6 states and 1794 transitions. [2025-03-13 22:17:46,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 1406 flow [2025-03-13 22:17:46,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 439 transitions, 1400 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:47,000 INFO L231 Difference]: Finished difference. Result has 393 places, 430 transitions, 1432 flow [2025-03-13 22:17:47,001 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-13 22:17:47,001 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 57 predicate places. [2025-03-13 22:17:47,001 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 430 transitions, 1432 flow [2025-03-13 22:17:47,002 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-13 22:17:47,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:47,002 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-13 22:17:47,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:17:47,002 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-13 22:17:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash -296968099, now seen corresponding path program 1 times [2025-03-13 22:17:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413125146] [2025-03-13 22:17:47,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:47,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-13 22:17:47,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-13 22:17:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:47,381 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-13 22:17:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413125146] [2025-03-13 22:17:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413125146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391949256] [2025-03-13 22:17:47,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:47,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:47,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:17:47,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-13 22:17:47,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-13 22:17:47,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:47,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:47,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:47,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:48,071 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-13 22:17:48,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:48,407 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-13 22:17:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391949256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:48,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:48,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812555986] [2025-03-13 22:17:48,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:48,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:48,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:48,584 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-13 22:17:48,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:48,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:48,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:48,999 INFO L124 PetriNetUnfolderBase]: 121/2050 cut-off events. [2025-03-13 22:17:48,999 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-03-13 22:17:49,003 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-13 22:17:49,006 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 19 selfloop transitions, 21 changer transitions 0/448 dead transitions. [2025-03-13 22:17:49,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 448 transitions, 1600 flow [2025-03-13 22:17:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-13 22:17:49,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-13 22:17:49,009 INFO L175 Difference]: Start difference. First operand has 393 places, 430 transitions, 1432 flow. Second operand 21 states and 6784 transitions. [2025-03-13 22:17:49,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 448 transitions, 1600 flow [2025-03-13 22:17:49,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 448 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:49,016 INFO L231 Difference]: Finished difference. Result has 418 places, 443 transitions, 1562 flow [2025-03-13 22:17:49,017 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-13 22:17:49,017 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 82 predicate places. [2025-03-13 22:17:49,017 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 443 transitions, 1562 flow [2025-03-13 22:17:49,018 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-13 22:17:49,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:49,019 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-13 22:17:49,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:49,219 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-13 22:17:49,219 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-13 22:17:49,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1319917021, now seen corresponding path program 2 times [2025-03-13 22:17:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854919561] [2025-03-13 22:17:49,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:49,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 889 statements into 2 equivalence classes. [2025-03-13 22:17:49,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 889 statements. [2025-03-13 22:17:49,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:49,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:49,445 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-13 22:17:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:49,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854919561] [2025-03-13 22:17:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854919561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:49,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:49,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279597975] [2025-03-13 22:17:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:49,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:49,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:49,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:49,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-13 22:17:49,765 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-13 22:17:49,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:49,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-13 22:17:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:50,737 INFO L124 PetriNetUnfolderBase]: 501/3119 cut-off events. [2025-03-13 22:17:50,737 INFO L125 PetriNetUnfolderBase]: For 973/1038 co-relation queries the response was YES. [2025-03-13 22:17:50,742 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-13 22:17:50,748 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 131 selfloop transitions, 130 changer transitions 0/580 dead transitions. [2025-03-13 22:17:50,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 580 transitions, 2734 flow [2025-03-13 22:17:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-03-13 22:17:50,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867457962413452 [2025-03-13 22:17:50,750 INFO L175 Difference]: Start difference. First operand has 418 places, 443 transitions, 1562 flow. Second operand 6 states and 1793 transitions. [2025-03-13 22:17:50,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 580 transitions, 2734 flow [2025-03-13 22:17:50,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 580 transitions, 2710 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:50,759 INFO L231 Difference]: Finished difference. Result has 422 places, 572 transitions, 2766 flow [2025-03-13 22:17:50,760 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-13 22:17:50,760 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 86 predicate places. [2025-03-13 22:17:50,760 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 572 transitions, 2766 flow [2025-03-13 22:17:50,761 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-13 22:17:50,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:50,761 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-13 22:17:50,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:17:50,761 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-13 22:17:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -752290828, now seen corresponding path program 1 times [2025-03-13 22:17:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292725847] [2025-03-13 22:17:50,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-13 22:17:50,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-13 22:17:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:52,058 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-13 22:17:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292725847] [2025-03-13 22:17:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292725847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300510069] [2025-03-13 22:17:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:52,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:52,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:52,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:17:52,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-13 22:17:52,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-13 22:17:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:52,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:52,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:53,197 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-13 22:17:53,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:53,819 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-13 22:17:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300510069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:53,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883643925] [2025-03-13 22:17:53,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:53,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:53,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:54,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-13 22:17:54,085 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-13 22:17:54,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:54,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-13 22:17:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:54,990 INFO L124 PetriNetUnfolderBase]: 382/3130 cut-off events. [2025-03-13 22:17:54,990 INFO L125 PetriNetUnfolderBase]: For 1290/1329 co-relation queries the response was YES. [2025-03-13 22:17:54,996 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-13 22:17:55,000 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 22 selfloop transitions, 30 changer transitions 0/589 dead transitions. [2025-03-13 22:17:55,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 589 transitions, 2992 flow [2025-03-13 22:17:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-13 22:17:55,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-13 22:17:55,005 INFO L175 Difference]: Start difference. First operand has 422 places, 572 transitions, 2766 flow. Second operand 30 states and 9684 transitions. [2025-03-13 22:17:55,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 589 transitions, 2992 flow [2025-03-13 22:17:55,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 589 transitions, 2992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:55,017 INFO L231 Difference]: Finished difference. Result has 455 places, 582 transitions, 2918 flow [2025-03-13 22:17:55,018 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-13 22:17:55,018 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 119 predicate places. [2025-03-13 22:17:55,018 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 582 transitions, 2918 flow [2025-03-13 22:17:55,020 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-13 22:17:55,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:55,020 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-13 22:17:55,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 22:17:55,221 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-13 22:17:55,221 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-13 22:17:55,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1447337510, now seen corresponding path program 2 times [2025-03-13 22:17:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:55,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772546425] [2025-03-13 22:17:55,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:55,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1214 statements into 2 equivalence classes. [2025-03-13 22:17:55,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1214 statements. [2025-03-13 22:17:55,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:55,485 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-13 22:17:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772546425] [2025-03-13 22:17:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772546425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:55,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306663613] [2025-03-13 22:17:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:55,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:55,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:55,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-13 22:17:55,788 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-13 22:17:55,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:55,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-13 22:17:55,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:57,021 INFO L124 PetriNetUnfolderBase]: 777/4205 cut-off events. [2025-03-13 22:17:57,021 INFO L125 PetriNetUnfolderBase]: For 3406/3570 co-relation queries the response was YES. [2025-03-13 22:17:57,032 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-13 22:17:57,039 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 251 selfloop transitions, 131 changer transitions 5/720 dead transitions. [2025-03-13 22:17:57,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 720 transitions, 4592 flow [2025-03-13 22:17:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-13 22:17:57,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-13 22:17:57,040 INFO L175 Difference]: Start difference. First operand has 455 places, 582 transitions, 2918 flow. Second operand 6 states and 1794 transitions. [2025-03-13 22:17:57,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 720 transitions, 4592 flow [2025-03-13 22:17:57,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 720 transitions, 4546 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:57,058 INFO L231 Difference]: Finished difference. Result has 447 places, 710 transitions, 4352 flow [2025-03-13 22:17:57,058 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-13 22:17:57,059 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 111 predicate places. [2025-03-13 22:17:57,059 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 710 transitions, 4352 flow [2025-03-13 22:17:57,059 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-13 22:17:57,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:57,060 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-13 22:17:57,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:17:57,060 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-13 22:17:57,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1730056866, now seen corresponding path program 1 times [2025-03-13 22:17:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:57,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631336444] [2025-03-13 22:17:57,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:57,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-03-13 22:17:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-03-13 22:17:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:59,924 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-13 22:17:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631336444] [2025-03-13 22:17:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631336444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391943253] [2025-03-13 22:17:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:59,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:59,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:00,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 337 [2025-03-13 22:18:00,157 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-13 22:18:00,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:00,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 337 [2025-03-13 22:18:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:01,976 INFO L124 PetriNetUnfolderBase]: 1309/5603 cut-off events. [2025-03-13 22:18:01,976 INFO L125 PetriNetUnfolderBase]: For 4983/5040 co-relation queries the response was YES. [2025-03-13 22:18:01,996 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-13 22:18:02,011 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 316 selfloop transitions, 84 changer transitions 0/789 dead transitions. [2025-03-13 22:18:02,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 789 transitions, 5550 flow [2025-03-13 22:18:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1672 transitions. [2025-03-13 22:18:02,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269040553907022 [2025-03-13 22:18:02,013 INFO L175 Difference]: Start difference. First operand has 447 places, 710 transitions, 4352 flow. Second operand 6 states and 1672 transitions. [2025-03-13 22:18:02,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 789 transitions, 5550 flow [2025-03-13 22:18:02,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 789 transitions, 5296 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-13 22:18:02,036 INFO L231 Difference]: Finished difference. Result has 456 places, 781 transitions, 4888 flow [2025-03-13 22:18:02,037 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-13 22:18:02,038 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 120 predicate places. [2025-03-13 22:18:02,038 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 781 transitions, 4888 flow [2025-03-13 22:18:02,038 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-13 22:18:02,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:02,039 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-13 22:18:02,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:18:02,039 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-13 22:18:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1349632936, now seen corresponding path program 1 times [2025-03-13 22:18:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851408508] [2025-03-13 22:18:02,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-13 22:18:04,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-13 22:18:04,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:04,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:39,649 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-13 22:18:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851408508] [2025-03-13 22:18:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851408508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271594431] [2025-03-13 22:18:39,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:39,651 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-13 22:18:39,652 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-13 22:18:40,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-13 22:18:41,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-13 22:18:41,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:41,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:41,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-13 22:18:41,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:41,782 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-13 22:18:41,783 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-13 22:18:42,270 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-13 22:18:42,270 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-13 22:18:43,017 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-13 22:18:43,018 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-13 22:18:43,355 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-13 22:18:43,355 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-13 22:18:44,059 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-13 22:18:44,059 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-13 22:18:44,418 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-13 22:18:44,418 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-13 22:18:45,481 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-13 22:18:45,481 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-13 22:18:46,447 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-13 22:18:46,447 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-13 22:18:48,008 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-13 22:18:48,009 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-13 22:18:49,051 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-13 22:18:49,691 INFO L349 Elim1Store]: treesize reduction 118, result has 33.0 percent of original size [2025-03-13 22:18:49,692 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-13 22:18:50,188 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-13 22:18:50,556 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-13 22:18:51,469 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-13 22:18:53,278 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-13 22:18:53,278 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-13 22:18:54,388 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-13 22:18:54,388 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