./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:38,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:38,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:38,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:38,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:38,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:38,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:38,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:38,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:38,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:38,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:38,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:38,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:38,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:38,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:38,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:38,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:38,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:38,261 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-01-09 21:22:38,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:38,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:38,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:38,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:38,499 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:38,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-01-09 21:22:39,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0390aeac/736ebe0c65e64fa58245e0a5c2d0fe24/FLAG9c7f85bd5 [2025-01-09 21:22:39,897 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:39,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-01-09 21:22:39,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0390aeac/736ebe0c65e64fa58245e0a5c2d0fe24/FLAG9c7f85bd5 [2025-01-09 21:22:40,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0390aeac/736ebe0c65e64fa58245e0a5c2d0fe24 [2025-01-09 21:22:40,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:40,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:40,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:40,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:40,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:40,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ee21bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40, skipping insertion in model container [2025-01-09 21:22:40,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:40,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:40,597 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:40,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:40,658 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:40,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40 WrapperNode [2025-01-09 21:22:40,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:40,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:40,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:40,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:40,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,689 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-01-09 21:22:40,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:40,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:40,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:40,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:40,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:40,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:40,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:40,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:40,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (1/1) ... [2025-01-09 21:22:40,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:40,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:22:40,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:22:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:40,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:40,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:40,768 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:40,863 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:40,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:41,103 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:41,103 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:41,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:41,118 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:41,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:41 BoogieIcfgContainer [2025-01-09 21:22:41,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:41,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:41,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:41,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:41,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:40" (1/3) ... [2025-01-09 21:22:41,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d88704a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:41, skipping insertion in model container [2025-01-09 21:22:41,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:40" (2/3) ... [2025-01-09 21:22:41,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d88704a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:41, skipping insertion in model container [2025-01-09 21:22:41,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:41" (3/3) ... [2025-01-09 21:22:41,125 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-01-09 21:22:41,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:41,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-09 21:22:41,138 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:41,193 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:41,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-01-09 21:22:41,286 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-01-09 21:22:41,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:41,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-01-09 21:22:41,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-01-09 21:22:41,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-01-09 21:22:41,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:41,321 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;@75d53e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:41,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:22:41,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:41,343 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-01-09 21:22:41,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:41,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:41,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:41,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1264436240, now seen corresponding path program 1 times [2025-01-09 21:22:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958723159] [2025-01-09 21:22:41,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:22:41,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:22:41,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:41,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:41,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958723159] [2025-01-09 21:22:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958723159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:41,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:41,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:22:41,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975609575] [2025-01-09 21:22:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:41,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:41,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:41,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:41,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:41,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-01-09 21:22:41,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:41,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:41,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-01-09 21:22:41,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:41,764 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-01-09 21:22:41,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:41,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 319 event pairs, 6 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-01-09 21:22:41,766 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-01-09 21:22:41,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-01-09 21:22:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-01-09 21:22:41,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-01-09 21:22:41,779 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-01-09 21:22:41,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-01-09 21:22:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:41,788 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-01-09 21:22:41,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-01-09 21:22:41,795 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-01-09 21:22:41,795 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-01-09 21:22:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:41,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:41,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:41,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:41,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:41,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1259896308, now seen corresponding path program 1 times [2025-01-09 21:22:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:41,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318767316] [2025-01-09 21:22:41,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:41,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:22:41,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:22:41,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:41,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318767316] [2025-01-09 21:22:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318767316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277943049] [2025-01-09 21:22:42,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:42,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:42,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:22:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:22:42,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:22:42,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:42,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:22:42,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:42,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277943049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:42,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:42,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:22:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015967770] [2025-01-09 21:22:42,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:42,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:22:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:42,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:22:42,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:22:42,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-01-09 21:22:42,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:42,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:42,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-01-09 21:22:42,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:42,359 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-01-09 21:22:42,360 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:42,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 227 events. 7/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 314 event pairs, 6 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-01-09 21:22:42,362 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-01-09 21:22:42,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-01-09 21:22:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:22:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:22:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-01-09 21:22:42,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-01-09 21:22:42,368 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-01-09 21:22:42,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-01-09 21:22:42,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:42,371 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-01-09 21:22:42,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=163} [2025-01-09 21:22:42,371 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-01-09 21:22:42,372 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-01-09 21:22:42,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:42,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:42,375 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:42,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:22:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:42,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:42,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1162936180, now seen corresponding path program 2 times [2025-01-09 21:22:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834415876] [2025-01-09 21:22:42,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:42,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-09 21:22:42,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-01-09 21:22:42,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:22:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834415876] [2025-01-09 21:22:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834415876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:43,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009096727] [2025-01-09 21:22:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:43,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:43,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:43,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:43,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-01-09 21:22:43,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:43,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:43,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-01-09 21:22:43,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:43,720 INFO L124 PetriNetUnfolderBase]: 103/540 cut-off events. [2025-01-09 21:22:43,720 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:22:43,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 540 events. 103/540 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2324 event pairs, 40 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 693. Up to 184 conditions per place. [2025-01-09 21:22:43,724 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 31 selfloop transitions, 22 changer transitions 0/192 dead transitions. [2025-01-09 21:22:43,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 192 transitions, 538 flow [2025-01-09 21:22:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2025-01-09 21:22:43,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.89375 [2025-01-09 21:22:43,728 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 858 transitions. [2025-01-09 21:22:43,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 192 transitions, 538 flow [2025-01-09 21:22:43,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 192 transitions, 532 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:43,733 INFO L231 Difference]: Finished difference. Result has 180 places, 184 transitions, 518 flow [2025-01-09 21:22:43,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=180, PETRI_TRANSITIONS=184} [2025-01-09 21:22:43,735 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 20 predicate places. [2025-01-09 21:22:43,735 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 184 transitions, 518 flow [2025-01-09 21:22:43,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:43,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:43,736 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:43,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:43,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash -731497224, now seen corresponding path program 1 times [2025-01-09 21:22:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:43,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334559479] [2025-01-09 21:22:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:43,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:22:43,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:22:43,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:43,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334559479] [2025-01-09 21:22:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334559479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705611340] [2025-01-09 21:22:43,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:43,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:43,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:43,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:43,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:22:43,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:22:43,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:22:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:22:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:44,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705611340] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:44,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:44,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:22:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145642247] [2025-01-09 21:22:44,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:22:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:44,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:22:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:22:44,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-01-09 21:22:44,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 184 transitions, 518 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:44,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:44,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-01-09 21:22:44,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:44,346 INFO L124 PetriNetUnfolderBase]: 38/396 cut-off events. [2025-01-09 21:22:44,346 INFO L125 PetriNetUnfolderBase]: For 57/62 co-relation queries the response was YES. [2025-01-09 21:22:44,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 396 events. 38/396 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1198 event pairs, 11 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 482. Up to 51 conditions per place. [2025-01-09 21:22:44,348 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-01-09 21:22:44,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 684 flow [2025-01-09 21:22:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:22:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:22:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-01-09 21:22:44,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-01-09 21:22:44,353 INFO L175 Difference]: Start difference. First operand has 180 places, 184 transitions, 518 flow. Second operand 21 states and 3067 transitions. [2025-01-09 21:22:44,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 684 flow [2025-01-09 21:22:44,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:44,358 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 648 flow [2025-01-09 21:22:44,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=648, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-01-09 21:22:44,359 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2025-01-09 21:22:44,359 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 648 flow [2025-01-09 21:22:44,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:44,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:44,361 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:44,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:44,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:44,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1735121400, now seen corresponding path program 2 times [2025-01-09 21:22:44,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:44,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149141936] [2025-01-09 21:22:44,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:44,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-01-09 21:22:44,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-01-09 21:22:44,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:44,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 21:22:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149141936] [2025-01-09 21:22:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149141936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:44,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235822042] [2025-01-09 21:22:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:44,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:44,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:44,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:45,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-01-09 21:22:45,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:45,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:45,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-01-09 21:22:45,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:45,416 INFO L124 PetriNetUnfolderBase]: 223/892 cut-off events. [2025-01-09 21:22:45,416 INFO L125 PetriNetUnfolderBase]: For 189/195 co-relation queries the response was YES. [2025-01-09 21:22:45,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 892 events. 223/892 cut-off events. For 189/195 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4668 event pairs, 82 based on Foata normal form. 5/839 useless extension candidates. Maximal degree in co-relation 1566. Up to 407 conditions per place. [2025-01-09 21:22:45,435 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 53 selfloop transitions, 39 changer transitions 5/242 dead transitions. [2025-01-09 21:22:45,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 242 transitions, 962 flow [2025-01-09 21:22:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-01-09 21:22:45,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2025-01-09 21:22:45,437 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 648 flow. Second operand 6 states and 844 transitions. [2025-01-09 21:22:45,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 242 transitions, 962 flow [2025-01-09 21:22:45,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 242 transitions, 938 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:22:45,442 INFO L231 Difference]: Finished difference. Result has 209 places, 233 transitions, 912 flow [2025-01-09 21:22:45,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=209, PETRI_TRANSITIONS=233} [2025-01-09 21:22:45,443 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2025-01-09 21:22:45,443 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 233 transitions, 912 flow [2025-01-09 21:22:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:45,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:45,444 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:45,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2131672241, now seen corresponding path program 1 times [2025-01-09 21:22:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592770484] [2025-01-09 21:22:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:22:45,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:22:45,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:45,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592770484] [2025-01-09 21:22:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592770484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381258686] [2025-01-09 21:22:45,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:45,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:45,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:22:45,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:22:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:22:45,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:22:45,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:45,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:46,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381258686] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:46,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:46,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:22:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184719020] [2025-01-09 21:22:46,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:46,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:22:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:22:46,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:22:46,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-01-09 21:22:46,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 233 transitions, 912 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:46,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:46,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-01-09 21:22:46,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:46,374 INFO L124 PetriNetUnfolderBase]: 117/655 cut-off events. [2025-01-09 21:22:46,374 INFO L125 PetriNetUnfolderBase]: For 327/332 co-relation queries the response was YES. [2025-01-09 21:22:46,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 655 events. 117/655 cut-off events. For 327/332 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2906 event pairs, 15 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 1115. Up to 118 conditions per place. [2025-01-09 21:22:46,379 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-01-09 21:22:46,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 250 transitions, 1136 flow [2025-01-09 21:22:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:22:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:22:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-01-09 21:22:46,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-01-09 21:22:46,386 INFO L175 Difference]: Start difference. First operand has 209 places, 233 transitions, 912 flow. Second operand 30 states and 4374 transitions. [2025-01-09 21:22:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 250 transitions, 1136 flow [2025-01-09 21:22:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 250 transitions, 1104 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:46,392 INFO L231 Difference]: Finished difference. Result has 241 places, 243 transitions, 1032 flow [2025-01-09 21:22:46,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1032, PETRI_PLACES=241, PETRI_TRANSITIONS=243} [2025-01-09 21:22:46,393 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 81 predicate places. [2025-01-09 21:22:46,393 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 243 transitions, 1032 flow [2025-01-09 21:22:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:46,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:46,395 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:46,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:46,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:46,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1806519347, now seen corresponding path program 2 times [2025-01-09 21:22:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275396946] [2025-01-09 21:22:46,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:46,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 21:22:46,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-01-09 21:22:46,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:46,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:22:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275396946] [2025-01-09 21:22:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275396946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:46,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426416902] [2025-01-09 21:22:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:46,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:46,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:46,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:46,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:46,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-01-09 21:22:46,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 243 transitions, 1032 flow. Second operand has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:46,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:46,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-01-09 21:22:46,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:47,086 INFO L124 PetriNetUnfolderBase]: 212/925 cut-off events. [2025-01-09 21:22:47,087 INFO L125 PetriNetUnfolderBase]: For 576/620 co-relation queries the response was YES. [2025-01-09 21:22:47,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 925 events. 212/925 cut-off events. For 576/620 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4942 event pairs, 40 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 1908. Up to 338 conditions per place. [2025-01-09 21:22:47,093 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 72 selfloop transitions, 40 changer transitions 0/282 dead transitions. [2025-01-09 21:22:47,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 282 transitions, 1440 flow [2025-01-09 21:22:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-01-09 21:22:47,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-01-09 21:22:47,097 INFO L175 Difference]: Start difference. First operand has 241 places, 243 transitions, 1032 flow. Second operand 6 states and 873 transitions. [2025-01-09 21:22:47,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 282 transitions, 1440 flow [2025-01-09 21:22:47,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 282 transitions, 1394 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:22:47,106 INFO L231 Difference]: Finished difference. Result has 233 places, 274 transitions, 1354 flow [2025-01-09 21:22:47,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=233, PETRI_TRANSITIONS=274} [2025-01-09 21:22:47,108 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 73 predicate places. [2025-01-09 21:22:47,109 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 274 transitions, 1354 flow [2025-01-09 21:22:47,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:47,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:47,110 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:22:47,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -651159112, now seen corresponding path program 1 times [2025-01-09 21:22:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:47,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135229870] [2025-01-09 21:22:47,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:47,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 21:22:47,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 21:22:47,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:47,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:22:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:47,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135229870] [2025-01-09 21:22:47,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135229870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:47,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357715613] [2025-01-09 21:22:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:47,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:47,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:47,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-01-09 21:22:47,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 274 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:47,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:47,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-01-09 21:22:47,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:47,807 INFO L124 PetriNetUnfolderBase]: 361/1326 cut-off events. [2025-01-09 21:22:47,807 INFO L125 PetriNetUnfolderBase]: For 1444/1472 co-relation queries the response was YES. [2025-01-09 21:22:47,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1326 events. 361/1326 cut-off events. For 1444/1472 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7994 event pairs, 87 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 3405. Up to 610 conditions per place. [2025-01-09 21:22:47,813 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 100 selfloop transitions, 64 changer transitions 10/335 dead transitions. [2025-01-09 21:22:47,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 335 transitions, 2042 flow [2025-01-09 21:22:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2025-01-09 21:22:47,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947916666666667 [2025-01-09 21:22:47,815 INFO L175 Difference]: Start difference. First operand has 233 places, 274 transitions, 1354 flow. Second operand 6 states and 859 transitions. [2025-01-09 21:22:47,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 335 transitions, 2042 flow [2025-01-09 21:22:47,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 335 transitions, 2024 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:47,827 INFO L231 Difference]: Finished difference. Result has 243 places, 321 transitions, 1922 flow [2025-01-09 21:22:47,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1922, PETRI_PLACES=243, PETRI_TRANSITIONS=321} [2025-01-09 21:22:47,828 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 83 predicate places. [2025-01-09 21:22:47,828 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 321 transitions, 1922 flow [2025-01-09 21:22:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:47,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:47,828 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:47,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:22:47,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:47,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1229549893, now seen corresponding path program 1 times [2025-01-09 21:22:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459326856] [2025-01-09 21:22:47,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:22:47,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:22:47,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:47,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:22:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459326856] [2025-01-09 21:22:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459326856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 21:22:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617578879] [2025-01-09 21:22:58,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 21:22:58,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 21:22:58,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-09 21:23:01,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 160 [2025-01-09 21:23:01,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 321 transitions, 1922 flow. Second operand has 17 states, 17 states have (on average 113.94117647058823) internal successors, (1937), 17 states have internal predecessors, (1937), 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-01-09 21:23:01,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:01,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 160 [2025-01-09 21:23:01,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:02,556 INFO L124 PetriNetUnfolderBase]: 566/1804 cut-off events. [2025-01-09 21:23:02,557 INFO L125 PetriNetUnfolderBase]: For 3430/3510 co-relation queries the response was YES. [2025-01-09 21:23:02,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 1804 events. 566/1804 cut-off events. For 3430/3510 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11313 event pairs, 32 based on Foata normal form. 37/1829 useless extension candidates. Maximal degree in co-relation 5589. Up to 562 conditions per place. [2025-01-09 21:23:02,567 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 227 selfloop transitions, 87 changer transitions 73/530 dead transitions. [2025-01-09 21:23:02,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 530 transitions, 4108 flow [2025-01-09 21:23:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 21:23:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 21:23:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2892 transitions. [2025-01-09 21:23:02,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.753125 [2025-01-09 21:23:02,572 INFO L175 Difference]: Start difference. First operand has 243 places, 321 transitions, 1922 flow. Second operand 24 states and 2892 transitions. [2025-01-09 21:23:02,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 530 transitions, 4108 flow [2025-01-09 21:23:02,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 530 transitions, 4022 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:02,593 INFO L231 Difference]: Finished difference. Result has 274 places, 358 transitions, 2488 flow [2025-01-09 21:23:02,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2488, PETRI_PLACES=274, PETRI_TRANSITIONS=358} [2025-01-09 21:23:02,594 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 114 predicate places. [2025-01-09 21:23:02,594 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 358 transitions, 2488 flow [2025-01-09 21:23:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 113.94117647058823) internal successors, (1937), 17 states have internal predecessors, (1937), 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-01-09 21:23:02,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:02,595 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:02,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1778251159, now seen corresponding path program 2 times [2025-01-09 21:23:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584573609] [2025-01-09 21:23:02,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:02,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-01-09 21:23:02,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-01-09 21:23:02,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:02,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:23:05,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:05,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584573609] [2025-01-09 21:23:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584573609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:05,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581172802] [2025-01-09 21:23:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:05,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:05,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:07,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 160 [2025-01-09 21:23:07,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 358 transitions, 2488 flow. Second operand has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 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-01-09 21:23:07,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:07,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 160 [2025-01-09 21:23:07,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:08,416 INFO L124 PetriNetUnfolderBase]: 456/1552 cut-off events. [2025-01-09 21:23:08,416 INFO L125 PetriNetUnfolderBase]: For 4318/4447 co-relation queries the response was YES. [2025-01-09 21:23:08,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 1552 events. 456/1552 cut-off events. For 4318/4447 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9631 event pairs, 80 based on Foata normal form. 63/1598 useless extension candidates. Maximal degree in co-relation 5675. Up to 662 conditions per place. [2025-01-09 21:23:08,424 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 174 selfloop transitions, 89 changer transitions 32/441 dead transitions. [2025-01-09 21:23:08,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 441 transitions, 3707 flow [2025-01-09 21:23:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1786 transitions. [2025-01-09 21:23:08,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7973214285714286 [2025-01-09 21:23:08,426 INFO L175 Difference]: Start difference. First operand has 274 places, 358 transitions, 2488 flow. Second operand 14 states and 1786 transitions. [2025-01-09 21:23:08,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 441 transitions, 3707 flow [2025-01-09 21:23:08,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 441 transitions, 3661 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:08,449 INFO L231 Difference]: Finished difference. Result has 276 places, 362 transitions, 2698 flow [2025-01-09 21:23:08,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2698, PETRI_PLACES=276, PETRI_TRANSITIONS=362} [2025-01-09 21:23:08,450 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 116 predicate places. [2025-01-09 21:23:08,450 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 362 transitions, 2698 flow [2025-01-09 21:23:08,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 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-01-09 21:23:08,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:08,451 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:08,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:08,451 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:08,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1287278003, now seen corresponding path program 3 times [2025-01-09 21:23:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500704756] [2025-01-09 21:23:08,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:08,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:08,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-01-09 21:23:08,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:08,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:23:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500704756] [2025-01-09 21:23:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500704756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197688563] [2025-01-09 21:23:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:08,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:08,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:09,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-01-09 21:23:09,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 362 transitions, 2698 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:09,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:09,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-01-09 21:23:09,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:10,269 INFO L124 PetriNetUnfolderBase]: 780/2434 cut-off events. [2025-01-09 21:23:10,269 INFO L125 PetriNetUnfolderBase]: For 9382/9517 co-relation queries the response was YES. [2025-01-09 21:23:10,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10410 conditions, 2434 events. 780/2434 cut-off events. For 9382/9517 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17685 event pairs, 58 based on Foata normal form. 59/2460 useless extension candidates. Maximal degree in co-relation 10120. Up to 632 conditions per place. [2025-01-09 21:23:10,285 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 348 selfloop transitions, 95 changer transitions 12/611 dead transitions. [2025-01-09 21:23:10,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 611 transitions, 6201 flow [2025-01-09 21:23:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1509 transitions. [2025-01-09 21:23:10,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573863636363637 [2025-01-09 21:23:10,287 INFO L175 Difference]: Start difference. First operand has 276 places, 362 transitions, 2698 flow. Second operand 11 states and 1509 transitions. [2025-01-09 21:23:10,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 611 transitions, 6201 flow [2025-01-09 21:23:10,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 611 transitions, 6039 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:10,322 INFO L231 Difference]: Finished difference. Result has 284 places, 442 transitions, 4094 flow [2025-01-09 21:23:10,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4094, PETRI_PLACES=284, PETRI_TRANSITIONS=442} [2025-01-09 21:23:10,323 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 124 predicate places. [2025-01-09 21:23:10,323 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 442 transitions, 4094 flow [2025-01-09 21:23:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:10,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:10,324 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:10,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1171562897, now seen corresponding path program 4 times [2025-01-09 21:23:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522432578] [2025-01-09 21:23:10,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:10,334 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-01-09 21:23:10,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:10,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522432578] [2025-01-09 21:23:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522432578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:23:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570107818] [2025-01-09 21:23:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:23:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:11,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:23:11,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:23:12,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-01-09 21:23:12,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 442 transitions, 4094 flow. Second operand has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:12,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:12,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-01-09 21:23:12,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:13,445 INFO L124 PetriNetUnfolderBase]: 860/2732 cut-off events. [2025-01-09 21:23:13,446 INFO L125 PetriNetUnfolderBase]: For 13478/13603 co-relation queries the response was YES. [2025-01-09 21:23:13,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 2732 events. 860/2732 cut-off events. For 13478/13603 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20261 event pairs, 73 based on Foata normal form. 48/2755 useless extension candidates. Maximal degree in co-relation 11683. Up to 658 conditions per place. [2025-01-09 21:23:13,466 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 406 selfloop transitions, 115 changer transitions 21/691 dead transitions. [2025-01-09 21:23:13,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 691 transitions, 7540 flow [2025-01-09 21:23:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 21:23:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 21:23:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2108 transitions. [2025-01-09 21:23:13,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8234375 [2025-01-09 21:23:13,468 INFO L175 Difference]: Start difference. First operand has 284 places, 442 transitions, 4094 flow. Second operand 16 states and 2108 transitions. [2025-01-09 21:23:13,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 691 transitions, 7540 flow [2025-01-09 21:23:13,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 691 transitions, 7492 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:13,518 INFO L231 Difference]: Finished difference. Result has 305 places, 472 transitions, 4855 flow [2025-01-09 21:23:13,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4046, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4855, PETRI_PLACES=305, PETRI_TRANSITIONS=472} [2025-01-09 21:23:13,519 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 145 predicate places. [2025-01-09 21:23:13,519 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 472 transitions, 4855 flow [2025-01-09 21:23:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:13,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:13,520 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:13,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:13,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:13,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1517793535, now seen corresponding path program 5 times [2025-01-09 21:23:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382455189] [2025-01-09 21:23:13,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:13,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:13,547 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:13,547 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-09 21:23:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382455189] [2025-01-09 21:23:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382455189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568510623] [2025-01-09 21:23:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:14,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:14,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:14,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-01-09 21:23:14,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 472 transitions, 4855 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:14,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:14,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-01-09 21:23:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:15,635 INFO L124 PetriNetUnfolderBase]: 860/2685 cut-off events. [2025-01-09 21:23:15,636 INFO L125 PetriNetUnfolderBase]: For 16586/16784 co-relation queries the response was YES. [2025-01-09 21:23:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12876 conditions, 2685 events. 860/2685 cut-off events. For 16586/16784 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 20100 event pairs, 146 based on Foata normal form. 105/2759 useless extension candidates. Maximal degree in co-relation 12571. Up to 1231 conditions per place. [2025-01-09 21:23:15,649 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 213 selfloop transitions, 161 changer transitions 19/545 dead transitions. [2025-01-09 21:23:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 545 transitions, 6383 flow [2025-01-09 21:23:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:23:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:23:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1615 transitions. [2025-01-09 21:23:15,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-01-09 21:23:15,650 INFO L175 Difference]: Start difference. First operand has 305 places, 472 transitions, 4855 flow. Second operand 12 states and 1615 transitions. [2025-01-09 21:23:15,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 545 transitions, 6383 flow [2025-01-09 21:23:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 545 transitions, 6225 flow, removed 69 selfloop flow, removed 7 redundant places. [2025-01-09 21:23:15,703 INFO L231 Difference]: Finished difference. Result has 314 places, 483 transitions, 5254 flow [2025-01-09 21:23:15,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5254, PETRI_PLACES=314, PETRI_TRANSITIONS=483} [2025-01-09 21:23:15,703 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 154 predicate places. [2025-01-09 21:23:15,703 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 483 transitions, 5254 flow [2025-01-09 21:23:15,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:15,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:15,704 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:15,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:23:15,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:15,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1611319655, now seen corresponding path program 6 times [2025-01-09 21:23:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951373772] [2025-01-09 21:23:15,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:15,718 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:15,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-01-09 21:23:15,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:15,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951373772] [2025-01-09 21:23:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951373772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:16,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057052060] [2025-01-09 21:23:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:16,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:16,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:16,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:16,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-01-09 21:23:16,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 483 transitions, 5254 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:16,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:16,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-01-09 21:23:16,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:17,601 INFO L124 PetriNetUnfolderBase]: 784/2568 cut-off events. [2025-01-09 21:23:17,601 INFO L125 PetriNetUnfolderBase]: For 17945/18081 co-relation queries the response was YES. [2025-01-09 21:23:17,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12675 conditions, 2568 events. 784/2568 cut-off events. For 17945/18081 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19352 event pairs, 56 based on Foata normal form. 66/2602 useless extension candidates. Maximal degree in co-relation 12435. Up to 622 conditions per place. [2025-01-09 21:23:17,617 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 383 selfloop transitions, 109 changer transitions 17/665 dead transitions. [2025-01-09 21:23:17,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 665 transitions, 8104 flow [2025-01-09 21:23:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1527 transitions. [2025-01-09 21:23:17,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676136363636363 [2025-01-09 21:23:17,618 INFO L175 Difference]: Start difference. First operand has 314 places, 483 transitions, 5254 flow. Second operand 11 states and 1527 transitions. [2025-01-09 21:23:17,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 665 transitions, 8104 flow [2025-01-09 21:23:17,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 665 transitions, 7749 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:17,680 INFO L231 Difference]: Finished difference. Result has 324 places, 505 transitions, 5609 flow [2025-01-09 21:23:17,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4955, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5609, PETRI_PLACES=324, PETRI_TRANSITIONS=505} [2025-01-09 21:23:17,681 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 164 predicate places. [2025-01-09 21:23:17,681 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 505 transitions, 5609 flow [2025-01-09 21:23:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:17,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:17,682 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:23:17,682 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:17,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -262123885, now seen corresponding path program 7 times [2025-01-09 21:23:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745474210] [2025-01-09 21:23:17,683 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:17,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:23:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-09 21:23:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745474210] [2025-01-09 21:23:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745474210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138700805] [2025-01-09 21:23:25,180 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:25,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:25,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:23:25,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:23:25,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:23:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:25,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 21:23:25,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:25,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 21:23:25,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 21:23:25,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-01-09 21:23:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-01-09 21:23:25,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-01-09 21:23:25,953 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:25,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-01-09 21:23:26,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:26,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:26,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:26,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:26,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:26,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-09 21:23:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 21:23:26,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:27,082 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 49 treesize of output 47 [2025-01-09 21:23:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138700805] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:27,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:27,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 25] total 47 [2025-01-09 21:23:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500533708] [2025-01-09 21:23:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:27,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:27,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:27,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2049, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 21:23:31,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-01-09 21:23:31,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 505 transitions, 5609 flow. Second operand has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 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-01-09 21:23:31,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:31,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-01-09 21:23:31,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:34,021 INFO L124 PetriNetUnfolderBase]: 861/2799 cut-off events. [2025-01-09 21:23:34,022 INFO L125 PetriNetUnfolderBase]: For 21840/21996 co-relation queries the response was YES. [2025-01-09 21:23:34,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14191 conditions, 2799 events. 861/2799 cut-off events. For 21840/21996 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 21393 event pairs, 80 based on Foata normal form. 94/2869 useless extension candidates. Maximal degree in co-relation 14054. Up to 1087 conditions per place. [2025-01-09 21:23:34,043 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 227 selfloop transitions, 240 changer transitions 12/634 dead transitions. [2025-01-09 21:23:34,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 634 transitions, 8357 flow [2025-01-09 21:23:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 21:23:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 21:23:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2133 transitions. [2025-01-09 21:23:34,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.833203125 [2025-01-09 21:23:34,050 INFO L175 Difference]: Start difference. First operand has 324 places, 505 transitions, 5609 flow. Second operand 16 states and 2133 transitions. [2025-01-09 21:23:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 634 transitions, 8357 flow [2025-01-09 21:23:34,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 634 transitions, 8191 flow, removed 56 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:34,144 INFO L231 Difference]: Finished difference. Result has 343 places, 574 transitions, 7288 flow [2025-01-09 21:23:34,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=5505, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7288, PETRI_PLACES=343, PETRI_TRANSITIONS=574} [2025-01-09 21:23:34,145 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 183 predicate places. [2025-01-09 21:23:34,145 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 574 transitions, 7288 flow [2025-01-09 21:23:34,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 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-01-09 21:23:34,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:34,145 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:34,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:23:34,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 21:23:34,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -296576425, now seen corresponding path program 8 times [2025-01-09 21:23:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44305663] [2025-01-09 21:23:34,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:34,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-01-09 21:23:34,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 168 statements. [2025-01-09 21:23:34,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:34,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:35,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44305663] [2025-01-09 21:23:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44305663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:35,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576280491] [2025-01-09 21:23:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:35,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:35,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:35,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:35,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-01-09 21:23:35,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 574 transitions, 7288 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:35,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:35,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-01-09 21:23:35,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:36,866 INFO L124 PetriNetUnfolderBase]: 922/2841 cut-off events. [2025-01-09 21:23:36,866 INFO L125 PetriNetUnfolderBase]: For 24670/24829 co-relation queries the response was YES. [2025-01-09 21:23:36,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15523 conditions, 2841 events. 922/2841 cut-off events. For 24670/24829 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 21361 event pairs, 113 based on Foata normal form. 64/2870 useless extension candidates. Maximal degree in co-relation 15367. Up to 768 conditions per place. [2025-01-09 21:23:36,885 INFO L140 encePairwiseOnDemand]: 139/160 looper letters, 422 selfloop transitions, 163 changer transitions 26/763 dead transitions. [2025-01-09 21:23:36,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 763 transitions, 10456 flow [2025-01-09 21:23:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1521 transitions. [2025-01-09 21:23:36,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8642045454545455 [2025-01-09 21:23:36,890 INFO L175 Difference]: Start difference. First operand has 343 places, 574 transitions, 7288 flow. Second operand 11 states and 1521 transitions. [2025-01-09 21:23:36,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 763 transitions, 10456 flow [2025-01-09 21:23:36,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 763 transitions, 10146 flow, removed 88 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:36,989 INFO L231 Difference]: Finished difference. Result has 355 places, 588 transitions, 7774 flow [2025-01-09 21:23:36,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=7022, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7774, PETRI_PLACES=355, PETRI_TRANSITIONS=588} [2025-01-09 21:23:36,990 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 195 predicate places. [2025-01-09 21:23:36,990 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 588 transitions, 7774 flow [2025-01-09 21:23:36,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:36,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:36,991 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:23:36,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:36,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -49674821, now seen corresponding path program 9 times [2025-01-09 21:23:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076448709] [2025-01-09 21:23:36,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:37,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:37,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 115 of 168 statements. [2025-01-09 21:23:37,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:37,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076448709] [2025-01-09 21:23:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076448709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343601019] [2025-01-09 21:23:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:37,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:37,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:37,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:38,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-01-09 21:23:38,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 588 transitions, 7774 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:38,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-01-09 21:23:38,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:39,270 INFO L124 PetriNetUnfolderBase]: 861/2779 cut-off events. [2025-01-09 21:23:39,271 INFO L125 PetriNetUnfolderBase]: For 27446/27601 co-relation queries the response was YES. [2025-01-09 21:23:39,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15529 conditions, 2779 events. 861/2779 cut-off events. For 27446/27601 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 21213 event pairs, 118 based on Foata normal form. 66/2805 useless extension candidates. Maximal degree in co-relation 15370. Up to 1195 conditions per place. [2025-01-09 21:23:39,296 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 293 selfloop transitions, 191 changer transitions 9/650 dead transitions. [2025-01-09 21:23:39,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 650 transitions, 9669 flow [2025-01-09 21:23:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:23:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:23:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1356 transitions. [2025-01-09 21:23:39,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475 [2025-01-09 21:23:39,299 INFO L175 Difference]: Start difference. First operand has 355 places, 588 transitions, 7774 flow. Second operand 10 states and 1356 transitions. [2025-01-09 21:23:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 650 transitions, 9669 flow [2025-01-09 21:23:39,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 650 transitions, 9292 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:39,426 INFO L231 Difference]: Finished difference. Result has 364 places, 609 transitions, 8380 flow [2025-01-09 21:23:39,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=7428, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8380, PETRI_PLACES=364, PETRI_TRANSITIONS=609} [2025-01-09 21:23:39,427 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 204 predicate places. [2025-01-09 21:23:39,427 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 609 transitions, 8380 flow [2025-01-09 21:23:39,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,428 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:23:39,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 873870895, now seen corresponding path program 1 times [2025-01-09 21:23:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751894899] [2025-01-09 21:23:39,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:23:39,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:39,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:39,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-09 21:23:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751894899] [2025-01-09 21:23:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751894899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964148423] [2025-01-09 21:23:42,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:42,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:42,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:42,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:23:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:23:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:23:42,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:42,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:42,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:42,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 21:23:42,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:42,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 21:23:43,013 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-01-09 21:23:43,065 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 11 treesize of output 7 [2025-01-09 21:23:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:23:43,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:23:43,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:23:43,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:43,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:43,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:43,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:43,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 47 [2025-01-09 21:23:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 21:23:43,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964148423] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:44,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:44,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 21] total 39 [2025-01-09 21:23:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569689672] [2025-01-09 21:23:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:44,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:44,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 21:23:47,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-01-09 21:23:47,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 609 transitions, 8380 flow. Second operand has 11 states, 11 states have (on average 132.36363636363637) internal successors, (1456), 11 states have internal predecessors, (1456), 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-01-09 21:23:47,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:47,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-01-09 21:23:47,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:49,307 INFO L124 PetriNetUnfolderBase]: 725/2548 cut-off events. [2025-01-09 21:23:49,308 INFO L125 PetriNetUnfolderBase]: For 27761/27983 co-relation queries the response was YES. [2025-01-09 21:23:49,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14273 conditions, 2548 events. 725/2548 cut-off events. For 27761/27983 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 19394 event pairs, 37 based on Foata normal form. 53/2584 useless extension candidates. Maximal degree in co-relation 13943. Up to 579 conditions per place. [2025-01-09 21:23:49,328 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 374 selfloop transitions, 150 changer transitions 35/772 dead transitions. [2025-01-09 21:23:49,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 772 transitions, 11233 flow [2025-01-09 21:23:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:23:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:23:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2491 transitions. [2025-01-09 21:23:49,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8649305555555555 [2025-01-09 21:23:49,331 INFO L175 Difference]: Start difference. First operand has 364 places, 609 transitions, 8380 flow. Second operand 18 states and 2491 transitions. [2025-01-09 21:23:49,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 772 transitions, 11233 flow [2025-01-09 21:23:49,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 772 transitions, 11069 flow, removed 65 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:49,460 INFO L231 Difference]: Finished difference. Result has 387 places, 660 transitions, 9460 flow [2025-01-09 21:23:49,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8222, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9460, PETRI_PLACES=387, PETRI_TRANSITIONS=660} [2025-01-09 21:23:49,461 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 227 predicate places. [2025-01-09 21:23:49,461 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 660 transitions, 9460 flow [2025-01-09 21:23:49,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 132.36363636363637) internal successors, (1456), 11 states have internal predecessors, (1456), 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-01-09 21:23:49,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:49,461 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:49,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:23:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 21:23:49,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash -981262387, now seen corresponding path program 10 times [2025-01-09 21:23:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494916794] [2025-01-09 21:23:49,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:49,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-01-09 21:23:49,685 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:49,687 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:49,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494916794] [2025-01-09 21:23:50,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494916794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521015940] [2025-01-09 21:23:50,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:50,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:50,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:23:50,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:23:50,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-01-09 21:23:50,602 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:50,602 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:50,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 21:23:50,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:50,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-09 21:23:50,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 21:23:50,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-01-09 21:23:50,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-01-09 21:23:51,112 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-01-09 21:23:51,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-01-09 21:23:51,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:51,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:51,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:51,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:51,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:51,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-01-09 21:23:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:23:51,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:51,859 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 49 treesize of output 47 [2025-01-09 21:23:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521015940] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 27] total 48 [2025-01-09 21:23:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197750802] [2025-01-09 21:23:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:51,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:51,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:51,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2178, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 21:23:54,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-01-09 21:23:54,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 660 transitions, 9460 flow. Second operand has 11 states, 11 states have (on average 125.9090909090909) internal successors, (1385), 11 states have internal predecessors, (1385), 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-01-09 21:23:54,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:54,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-01-09 21:23:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:57,076 INFO L124 PetriNetUnfolderBase]: 905/2900 cut-off events. [2025-01-09 21:23:57,076 INFO L125 PetriNetUnfolderBase]: For 33822/33997 co-relation queries the response was YES. [2025-01-09 21:23:57,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17343 conditions, 2900 events. 905/2900 cut-off events. For 33822/33997 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22295 event pairs, 96 based on Foata normal form. 96/2959 useless extension candidates. Maximal degree in co-relation 17059. Up to 1190 conditions per place. [2025-01-09 21:23:57,097 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 284 selfloop transitions, 313 changer transitions 20/770 dead transitions. [2025-01-09 21:23:57,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 770 transitions, 12408 flow [2025-01-09 21:23:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 21:23:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 21:23:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2134 transitions. [2025-01-09 21:23:57,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83359375 [2025-01-09 21:23:57,099 INFO L175 Difference]: Start difference. First operand has 387 places, 660 transitions, 9460 flow. Second operand 16 states and 2134 transitions. [2025-01-09 21:23:57,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 770 transitions, 12408 flow [2025-01-09 21:23:57,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 770 transitions, 12338 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:57,231 INFO L231 Difference]: Finished difference. Result has 401 places, 697 transitions, 11066 flow [2025-01-09 21:23:57,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9401, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11066, PETRI_PLACES=401, PETRI_TRANSITIONS=697} [2025-01-09 21:23:57,232 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 241 predicate places. [2025-01-09 21:23:57,232 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 697 transitions, 11066 flow [2025-01-09 21:23:57,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.9090909090909) internal successors, (1385), 11 states have internal predecessors, (1385), 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-01-09 21:23:57,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:57,233 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:57,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:23:57,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:57,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:57,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1086835497, now seen corresponding path program 11 times [2025-01-09 21:23:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35126093] [2025-01-09 21:23:57,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:57,443 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:57,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:23:57,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-09 21:23:57,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:57,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35126093] [2025-01-09 21:23:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35126093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:57,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:57,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864547434] [2025-01-09 21:23:57,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:57,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:57,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:57,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:58,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-01-09 21:23:58,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 697 transitions, 11066 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:58,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:58,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-01-09 21:23:58,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:59,592 INFO L124 PetriNetUnfolderBase]: 873/2856 cut-off events. [2025-01-09 21:23:59,593 INFO L125 PetriNetUnfolderBase]: For 39009/39189 co-relation queries the response was YES. [2025-01-09 21:23:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18131 conditions, 2856 events. 873/2856 cut-off events. For 39009/39189 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22026 event pairs, 79 based on Foata normal form. 70/2883 useless extension candidates. Maximal degree in co-relation 17820. Up to 695 conditions per place. [2025-01-09 21:23:59,621 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 484 selfloop transitions, 166 changer transitions 9/822 dead transitions. [2025-01-09 21:23:59,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 822 transitions, 13827 flow [2025-01-09 21:23:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1513 transitions. [2025-01-09 21:23:59,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8596590909090909 [2025-01-09 21:23:59,680 INFO L175 Difference]: Start difference. First operand has 401 places, 697 transitions, 11066 flow. Second operand 11 states and 1513 transitions. [2025-01-09 21:23:59,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 822 transitions, 13827 flow [2025-01-09 21:23:59,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 822 transitions, 13525 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:59,844 INFO L231 Difference]: Finished difference. Result has 410 places, 704 transitions, 11332 flow [2025-01-09 21:23:59,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=10786, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11332, PETRI_PLACES=410, PETRI_TRANSITIONS=704} [2025-01-09 21:23:59,845 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 250 predicate places. [2025-01-09 21:23:59,845 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 704 transitions, 11332 flow [2025-01-09 21:23:59,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:59,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:59,846 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:59,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:23:59,846 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:59,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2004729219, now seen corresponding path program 12 times [2025-01-09 21:23:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300313493] [2025-01-09 21:23:59,847 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:59,856 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-01-09 21:23:59,860 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 115 of 168 statements. [2025-01-09 21:23:59,860 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:59,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:24:00,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:00,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300313493] [2025-01-09 21:24:00,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300313493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:00,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:00,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:24:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723685980] [2025-01-09 21:24:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:00,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:00,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:00,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:00,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:01,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-01-09 21:24:01,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 704 transitions, 11332 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:01,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:01,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-01-09 21:24:01,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:01,944 INFO L124 PetriNetUnfolderBase]: 877/2865 cut-off events. [2025-01-09 21:24:01,944 INFO L125 PetriNetUnfolderBase]: For 40738/40925 co-relation queries the response was YES. [2025-01-09 21:24:01,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18291 conditions, 2865 events. 877/2865 cut-off events. For 40738/40925 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 22119 event pairs, 78 based on Foata normal form. 76/2897 useless extension candidates. Maximal degree in co-relation 17979. Up to 695 conditions per place. [2025-01-09 21:24:01,968 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 478 selfloop transitions, 179 changer transitions 9/829 dead transitions. [2025-01-09 21:24:01,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 829 transitions, 14112 flow [2025-01-09 21:24:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:24:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:24:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1517 transitions. [2025-01-09 21:24:01,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8619318181818182 [2025-01-09 21:24:01,970 INFO L175 Difference]: Start difference. First operand has 410 places, 704 transitions, 11332 flow. Second operand 11 states and 1517 transitions. [2025-01-09 21:24:01,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 829 transitions, 14112 flow [2025-01-09 21:24:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 829 transitions, 13868 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:02,135 INFO L231 Difference]: Finished difference. Result has 418 places, 712 transitions, 11735 flow [2025-01-09 21:24:02,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=11093, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11735, PETRI_PLACES=418, PETRI_TRANSITIONS=712} [2025-01-09 21:24:02,136 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 258 predicate places. [2025-01-09 21:24:02,136 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 712 transitions, 11735 flow [2025-01-09 21:24:02,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:02,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:02,136 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:24:02,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:24:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2136072309, now seen corresponding path program 13 times [2025-01-09 21:24:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336665912] [2025-01-09 21:24:02,138 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:24:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:02,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:24:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:24:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat