./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.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/pthread-ext/48_ticket_lock_low_contention_vs-b.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 bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:07:41,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:07:41,907 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:07:41,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:07:41,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:07:41,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:07:41,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:07:41,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:07:41,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:07:41,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:07:41,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:07:41,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:07:41,939 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:07:41,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:07:41,940 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:07:41,941 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:41,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:07:41,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:41,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:07:41,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:07:41,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:07:41,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:07:41,943 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 -> bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 [2025-01-09 21:07:42,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:07:42,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:07:42,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:07:42,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:07:42,137 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:07:42,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-01-09 21:07:43,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41d433afb/4d1f10fd635b41d0adfcb223fcbdee68/FLAG03230f638 [2025-01-09 21:07:43,463 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:07:43,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-01-09 21:07:43,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41d433afb/4d1f10fd635b41d0adfcb223fcbdee68/FLAG03230f638 [2025-01-09 21:07:43,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41d433afb/4d1f10fd635b41d0adfcb223fcbdee68 [2025-01-09 21:07:43,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:07:43,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:07:43,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:43,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:07:43,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:07:43,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:43" (1/1) ... [2025-01-09 21:07:43,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1d7632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:43, skipping insertion in model container [2025-01-09 21:07:43,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:07:43" (1/1) ... [2025-01-09 21:07:43,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:07:44,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:44,038 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:07:44,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:07:44,100 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:07:44,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44 WrapperNode [2025-01-09 21:07:44,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:07:44,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:44,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:07:44,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:07:44,109 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:07:44" (1/1) ... [2025-01-09 21:07:44,119 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:07:44" (1/1) ... [2025-01-09 21:07:44,138 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 175 [2025-01-09 21:07:44,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:07:44,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:07:44,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:07:44,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:07:44,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:07:44,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:07:44,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:07:44,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:07:44,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (1/1) ... [2025-01-09 21:07:44,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:07:44,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:07:44,216 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:07:44,220 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:07:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:07:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:07:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:07:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:07:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:07:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:07:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:07:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:07:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:07:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:07:44,235 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:07:44,310 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:07:44,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:07:44,532 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:07:44,532 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:07:44,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:07:44,679 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:07:44,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:44 BoogieIcfgContainer [2025-01-09 21:07:44,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:07:44,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:07:44,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:07:44,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:07:44,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:07:43" (1/3) ... [2025-01-09 21:07:44,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a54f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:44, skipping insertion in model container [2025-01-09 21:07:44,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:07:44" (2/3) ... [2025-01-09 21:07:44,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a54f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:07:44, skipping insertion in model container [2025-01-09 21:07:44,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:07:44" (3/3) ... [2025-01-09 21:07:44,688 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-b.i [2025-01-09 21:07:44,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:07:44,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-b.i that has 2 procedures, 147 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-01-09 21:07:44,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:07:44,766 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:44,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 156 transitions, 316 flow [2025-01-09 21:07:44,879 INFO L124 PetriNetUnfolderBase]: 14/237 cut-off events. [2025-01-09 21:07:44,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 237 events. 14/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 807 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 142. Up to 4 conditions per place. [2025-01-09 21:07:44,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 156 transitions, 316 flow [2025-01-09 21:07:44,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 156 transitions, 316 flow [2025-01-09 21:07:44,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:44,911 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;@597e8b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:44,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:07:44,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:44,917 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-01-09 21:07:44,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:44,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:44,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:44,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:07:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 766095576, now seen corresponding path program 1 times [2025-01-09 21:07:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:44,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248950226] [2025-01-09 21:07:44,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:07:44,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:07:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:45,070 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:07:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:45,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248950226] [2025-01-09 21:07:45,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248950226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472726835] [2025-01-09 21:07:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:45,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 156 [2025-01-09 21:07:45,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 156 transitions, 316 flow. Second operand has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 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:07:45,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:45,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 156 [2025-01-09 21:07:45,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:45,145 INFO L124 PetriNetUnfolderBase]: 5/255 cut-off events. [2025-01-09 21:07:45,145 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:07:45,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 255 events. 5/255 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 785 event pairs, 1 based on Foata normal form. 16/232 useless extension candidates. Maximal degree in co-relation 175. Up to 7 conditions per place. [2025-01-09 21:07:45,147 INFO L140 encePairwiseOnDemand]: 139/156 looper letters, 3 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2025-01-09 21:07:45,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 280 flow [2025-01-09 21:07:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 288 transitions. [2025-01-09 21:07:45,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-01-09 21:07:45,157 INFO L175 Difference]: Start difference. First operand has 150 places, 156 transitions, 316 flow. Second operand 2 states and 288 transitions. [2025-01-09 21:07:45,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 280 flow [2025-01-09 21:07:45,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:45,163 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 274 flow [2025-01-09 21:07:45,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=274, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2025-01-09 21:07:45,166 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -13 predicate places. [2025-01-09 21:07:45,167 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 274 flow [2025-01-09 21:07:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 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:07:45,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:45,167 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:45,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:07:45,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:07:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 293047676, now seen corresponding path program 1 times [2025-01-09 21:07:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-01-09 21:07:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:45,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:45,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:45,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:45,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:45,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:45,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:45,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:45,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:45,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-01-09 21:07:45,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-01-09 21:07:45,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-01-09 21:07:45,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-01-09 21:07:45,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:07:45,215 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 21:07:45,218 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:45,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:07:45,261 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:45,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 218 transitions, 446 flow [2025-01-09 21:07:45,311 INFO L124 PetriNetUnfolderBase]: 23/380 cut-off events. [2025-01-09 21:07:45,312 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:07:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 380 events. 23/380 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1696 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 238. Up to 6 conditions per place. [2025-01-09 21:07:45,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 218 transitions, 446 flow [2025-01-09 21:07:45,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 218 transitions, 446 flow [2025-01-09 21:07:45,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:45,326 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;@597e8b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:45,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-09 21:07:45,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:45,330 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-01-09 21:07:45,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:45,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:45,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:45,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:07:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 372286578, now seen corresponding path program 1 times [2025-01-09 21:07:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:07:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:45,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:07:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:07:45,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:45,377 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:07:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-01-09 21:07:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386283618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239562470] [2025-01-09 21:07:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:45,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:45,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:45,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2025-01-09 21:07:45,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 218 transitions, 446 flow. Second operand has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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:07:45,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:45,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2025-01-09 21:07:45,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:45,510 INFO L124 PetriNetUnfolderBase]: 18/628 cut-off events. [2025-01-09 21:07:45,510 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:07:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 628 events. 18/628 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3582 event pairs, 7 based on Foata normal form. 46/567 useless extension candidates. Maximal degree in co-relation 385. Up to 21 conditions per place. [2025-01-09 21:07:45,514 INFO L140 encePairwiseOnDemand]: 193/218 looper letters, 5 selfloop transitions, 0 changer transitions 0/187 dead transitions. [2025-01-09 21:07:45,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 187 transitions, 394 flow [2025-01-09 21:07:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 400 transitions. [2025-01-09 21:07:45,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2025-01-09 21:07:45,516 INFO L175 Difference]: Start difference. First operand has 210 places, 218 transitions, 446 flow. Second operand 2 states and 400 transitions. [2025-01-09 21:07:45,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 187 transitions, 394 flow [2025-01-09 21:07:45,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:45,519 INFO L231 Difference]: Finished difference. Result has 190 places, 187 transitions, 384 flow [2025-01-09 21:07:45,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=384, PETRI_PLACES=190, PETRI_TRANSITIONS=187} [2025-01-09 21:07:45,519 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2025-01-09 21:07:45,520 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 187 transitions, 384 flow [2025-01-09 21:07:45,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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:07:45,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:45,520 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] [2025-01-09 21:07:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:07:45,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:07:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1176132886, now seen corresponding path program 1 times [2025-01-09 21:07:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862392976] [2025-01-09 21:07:45,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:45,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:45,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:45,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:45,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:45,948 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:07:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862392976] [2025-01-09 21:07:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862392976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:45,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:07:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609217854] [2025-01-09 21:07:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:07:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:07:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:07:46,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-01-09 21:07:46,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 187 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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:07:46,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-01-09 21:07:46,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:46,443 INFO L124 PetriNetUnfolderBase]: 134/2680 cut-off events. [2025-01-09 21:07:46,444 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:07:46,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 2680 events. 134/2680 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 24261 event pairs, 33 based on Foata normal form. 0/2214 useless extension candidates. Maximal degree in co-relation 2899. Up to 141 conditions per place. [2025-01-09 21:07:46,462 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 18 selfloop transitions, 14 changer transitions 0/204 dead transitions. [2025-01-09 21:07:46,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 204 transitions, 482 flow [2025-01-09 21:07:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:07:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:07:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1083 transitions. [2025-01-09 21:07:46,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8279816513761468 [2025-01-09 21:07:46,465 INFO L175 Difference]: Start difference. First operand has 190 places, 187 transitions, 384 flow. Second operand 6 states and 1083 transitions. [2025-01-09 21:07:46,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 204 transitions, 482 flow [2025-01-09 21:07:46,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 204 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:46,469 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 486 flow [2025-01-09 21:07:46,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2025-01-09 21:07:46,469 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -10 predicate places. [2025-01-09 21:07:46,470 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 486 flow [2025-01-09 21:07:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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:07:46,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:46,470 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] [2025-01-09 21:07:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:07:46,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:07:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -761424775, now seen corresponding path program 1 times [2025-01-09 21:07:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-01-09 21:07:46,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:46,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:07:46,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:07:46,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:46,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:46,721 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:07:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-01-09 21:07:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851627377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:46,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:07:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452617232] [2025-01-09 21:07:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:46,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:07:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:46,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:07:46,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:07:46,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 218 [2025-01-09 21:07:46,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 201 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 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:07:46,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:46,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 218 [2025-01-09 21:07:46,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:47,394 INFO L124 PetriNetUnfolderBase]: 424/5479 cut-off events. [2025-01-09 21:07:47,394 INFO L125 PetriNetUnfolderBase]: For 551/587 co-relation queries the response was YES. [2025-01-09 21:07:47,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 5479 events. 424/5479 cut-off events. For 551/587 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 59229 event pairs, 36 based on Foata normal form. 0/4584 useless extension candidates. Maximal degree in co-relation 6930. Up to 366 conditions per place. [2025-01-09 21:07:47,436 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 28 selfloop transitions, 30 changer transitions 0/238 dead transitions. [2025-01-09 21:07:47,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 238 transitions, 768 flow [2025-01-09 21:07:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:07:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:07:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2025-01-09 21:07:47,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8386850152905199 [2025-01-09 21:07:47,443 INFO L175 Difference]: Start difference. First operand has 200 places, 201 transitions, 486 flow. Second operand 6 states and 1097 transitions. [2025-01-09 21:07:47,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 238 transitions, 768 flow [2025-01-09 21:07:47,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 238 transitions, 768 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:47,455 INFO L231 Difference]: Finished difference. Result has 210 places, 231 transitions, 764 flow [2025-01-09 21:07:47,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=210, PETRI_TRANSITIONS=231} [2025-01-09 21:07:47,456 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 0 predicate places. [2025-01-09 21:07:47,457 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 231 transitions, 764 flow [2025-01-09 21:07:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 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:07:47,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:47,458 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] [2025-01-09 21:07:47,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:07:47,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:07:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -687284198, now seen corresponding path program 1 times [2025-01-09 21:07:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-01-09 21:07:47,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:47,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:07:47,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:07:47,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:47,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:47,493 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:07:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874201084] [2025-01-09 21:07:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874201084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:47,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968722625] [2025-01-09 21:07:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:47,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:47,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:47,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 218 [2025-01-09 21:07:47,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 231 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:07:47,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:47,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 218 [2025-01-09 21:07:47,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:50,278 INFO L124 PetriNetUnfolderBase]: 4584/30499 cut-off events. [2025-01-09 21:07:50,278 INFO L125 PetriNetUnfolderBase]: For 5516/5675 co-relation queries the response was YES. [2025-01-09 21:07:50,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43317 conditions, 30499 events. 4584/30499 cut-off events. For 5516/5675 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 437006 event pairs, 1493 based on Foata normal form. 3/26115 useless extension candidates. Maximal degree in co-relation 43302. Up to 5433 conditions per place. [2025-01-09 21:07:50,499 INFO L140 encePairwiseOnDemand]: 197/218 looper letters, 94 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2025-01-09 21:07:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 282 transitions, 1305 flow [2025-01-09 21:07:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:07:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:07:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-01-09 21:07:50,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8302752293577982 [2025-01-09 21:07:50,502 INFO L175 Difference]: Start difference. First operand has 210 places, 231 transitions, 764 flow. Second operand 3 states and 543 transitions. [2025-01-09 21:07:50,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 282 transitions, 1305 flow [2025-01-09 21:07:50,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 282 transitions, 1305 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:50,514 INFO L231 Difference]: Finished difference. Result has 214 places, 246 transitions, 896 flow [2025-01-09 21:07:50,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=214, PETRI_TRANSITIONS=246} [2025-01-09 21:07:50,515 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2025-01-09 21:07:50,515 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 246 transitions, 896 flow [2025-01-09 21:07:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:07:50,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:50,516 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:50,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:07:50,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:07:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1692695834, now seen corresponding path program 1 times [2025-01-09 21:07:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797800194] [2025-01-09 21:07:50,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:50,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:07:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:07:50,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:50,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:07:50,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:07:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:07:50,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:07:50,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:07:50,534 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-01-09 21:07:50,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-01-09 21:07:50,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-01-09 21:07:50,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-01-09 21:07:50,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:07:50,537 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:07:50,537 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:07:50,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:07:50,579 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:07:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 280 transitions, 578 flow [2025-01-09 21:07:50,629 INFO L124 PetriNetUnfolderBase]: 32/523 cut-off events. [2025-01-09 21:07:50,630 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:07:50,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 523 events. 32/523 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2678 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 384. Up to 8 conditions per place. [2025-01-09 21:07:50,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 280 transitions, 578 flow [2025-01-09 21:07:50,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 280 transitions, 578 flow [2025-01-09 21:07:50,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:07:50,640 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;@597e8b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:07:50,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-09 21:07:50,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:07:50,642 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-01-09 21:07:50,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:07:50,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:50,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:07:50,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:07:50,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 851561098, now seen corresponding path program 1 times [2025-01-09 21:07:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226785774] [2025-01-09 21:07:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:50,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:07:50,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:07:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:50,651 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:07:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226785774] [2025-01-09 21:07:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226785774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117633284] [2025-01-09 21:07:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:07:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:07:50,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:07:50,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-01-09 21:07:50,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 280 transitions, 578 flow. Second operand has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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:07:50,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:50,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-01-09 21:07:50,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:50,870 INFO L124 PetriNetUnfolderBase]: 53/1407 cut-off events. [2025-01-09 21:07:50,871 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:07:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1407 events. 53/1407 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11151 event pairs, 27 based on Foata normal form. 116/1271 useless extension candidates. Maximal degree in co-relation 811. Up to 57 conditions per place. [2025-01-09 21:07:50,884 INFO L140 encePairwiseOnDemand]: 247/280 looper letters, 7 selfloop transitions, 0 changer transitions 0/239 dead transitions. [2025-01-09 21:07:50,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 239 transitions, 510 flow [2025-01-09 21:07:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:07:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:07:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 512 transitions. [2025-01-09 21:07:50,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2025-01-09 21:07:50,886 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 578 flow. Second operand 2 states and 512 transitions. [2025-01-09 21:07:50,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 239 transitions, 510 flow [2025-01-09 21:07:50,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 239 transitions, 508 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:50,889 INFO L231 Difference]: Finished difference. Result has 243 places, 239 transitions, 494 flow [2025-01-09 21:07:50,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=494, PETRI_PLACES=243, PETRI_TRANSITIONS=239} [2025-01-09 21:07:50,890 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -27 predicate places. [2025-01-09 21:07:50,890 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 239 transitions, 494 flow [2025-01-09 21:07:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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:07:50,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:50,890 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] [2025-01-09 21:07:50,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:07:50,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:07:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1865462550, now seen corresponding path program 1 times [2025-01-09 21:07:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-01-09 21:07:50,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:50,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:07:50,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:07:50,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:51,047 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:07:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:51,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-01-09 21:07:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828254128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:51,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:51,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:07:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861974994] [2025-01-09 21:07:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:51,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:07:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:51,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:07:51,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:07:51,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-01-09 21:07:51,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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:07:51,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:51,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-01-09 21:07:51,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:51,870 INFO L124 PetriNetUnfolderBase]: 444/7105 cut-off events. [2025-01-09 21:07:51,870 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:07:51,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 7105 events. 444/7105 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 81841 event pairs, 131 based on Foata normal form. 0/5860 useless extension candidates. Maximal degree in co-relation 7723. Up to 442 conditions per place. [2025-01-09 21:07:51,919 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 20 selfloop transitions, 18 changer transitions 0/260 dead transitions. [2025-01-09 21:07:51,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 260 transitions, 612 flow [2025-01-09 21:07:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:07:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:07:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1395 transitions. [2025-01-09 21:07:51,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8303571428571429 [2025-01-09 21:07:51,922 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 494 flow. Second operand 6 states and 1395 transitions. [2025-01-09 21:07:51,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 260 transitions, 612 flow [2025-01-09 21:07:51,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 260 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:51,925 INFO L231 Difference]: Finished difference. Result has 253 places, 257 transitions, 622 flow [2025-01-09 21:07:51,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=253, PETRI_TRANSITIONS=257} [2025-01-09 21:07:51,926 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -17 predicate places. [2025-01-09 21:07:51,926 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 257 transitions, 622 flow [2025-01-09 21:07:51,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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:07:51,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:51,927 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] [2025-01-09 21:07:51,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:07:51,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:07:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 241770484, now seen corresponding path program 1 times [2025-01-09 21:07:51,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:51,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319829311] [2025-01-09 21:07:51,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:51,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:07:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:07:51,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:52,108 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:07:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319829311] [2025-01-09 21:07:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319829311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:07:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889326996] [2025-01-09 21:07:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:07:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:52,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:07:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:07:52,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 280 [2025-01-09 21:07:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 257 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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:07:52,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 280 [2025-01-09 21:07:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:07:54,153 INFO L124 PetriNetUnfolderBase]: 1843/18400 cut-off events. [2025-01-09 21:07:54,153 INFO L125 PetriNetUnfolderBase]: For 2536/2644 co-relation queries the response was YES. [2025-01-09 21:07:54,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23689 conditions, 18400 events. 1843/18400 cut-off events. For 2536/2644 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 250003 event pairs, 169 based on Foata normal form. 0/15321 useless extension candidates. Maximal degree in co-relation 23678. Up to 1595 conditions per place. [2025-01-09 21:07:54,389 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 38 selfloop transitions, 50 changer transitions 0/318 dead transitions. [2025-01-09 21:07:54,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 318 transitions, 1104 flow [2025-01-09 21:07:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:07:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:07:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1413 transitions. [2025-01-09 21:07:54,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410714285714286 [2025-01-09 21:07:54,393 INFO L175 Difference]: Start difference. First operand has 253 places, 257 transitions, 622 flow. Second operand 6 states and 1413 transitions. [2025-01-09 21:07:54,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 318 transitions, 1104 flow [2025-01-09 21:07:54,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 318 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:07:54,402 INFO L231 Difference]: Finished difference. Result has 263 places, 307 transitions, 1102 flow [2025-01-09 21:07:54,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1102, PETRI_PLACES=263, PETRI_TRANSITIONS=307} [2025-01-09 21:07:54,402 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -7 predicate places. [2025-01-09 21:07:54,402 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 307 transitions, 1102 flow [2025-01-09 21:07:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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:07:54,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:07:54,403 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] [2025-01-09 21:07:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:07:54,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:07:54,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:07:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1708118758, now seen corresponding path program 1 times [2025-01-09 21:07:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:07:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919457811] [2025-01-09 21:07:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:07:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:07:54,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:07:54,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:07:54,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:07:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:07:54,428 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:07:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:07:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919457811] [2025-01-09 21:07:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919457811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:07:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:07:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:07:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733483572] [2025-01-09 21:07:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:07:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:07:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:07:54,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:07:54,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:07:54,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 280 [2025-01-09 21:07:54,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 307 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:07:54,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:07:54,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 280 [2025-01-09 21:07:54,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:08:29,296 INFO L124 PetriNetUnfolderBase]: 74421/327896 cut-off events. [2025-01-09 21:08:29,297 INFO L125 PetriNetUnfolderBase]: For 103414/106340 co-relation queries the response was YES. [2025-01-09 21:08:31,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498756 conditions, 327896 events. 74421/327896 cut-off events. For 103414/106340 co-relation queries the response was YES. Maximal size of possible extension queue 6882. Compared 5988379 event pairs, 25975 based on Foata normal form. 17/277103 useless extension candidates. Maximal degree in co-relation 498740. Up to 75459 conditions per place. [2025-01-09 21:08:33,451 INFO L140 encePairwiseOnDemand]: 252/280 looper letters, 153 selfloop transitions, 20 changer transitions 0/389 dead transitions. [2025-01-09 21:08:33,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 389 transitions, 2018 flow [2025-01-09 21:08:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:08:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:08:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-01-09 21:08:33,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.825 [2025-01-09 21:08:33,458 INFO L175 Difference]: Start difference. First operand has 263 places, 307 transitions, 1102 flow. Second operand 3 states and 693 transitions. [2025-01-09 21:08:33,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 389 transitions, 2018 flow [2025-01-09 21:08:33,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 389 transitions, 2018 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:08:33,568 INFO L231 Difference]: Finished difference. Result has 267 places, 327 transitions, 1278 flow [2025-01-09 21:08:33,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=267, PETRI_TRANSITIONS=327} [2025-01-09 21:08:33,568 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -3 predicate places. [2025-01-09 21:08:33,569 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 327 transitions, 1278 flow [2025-01-09 21:08:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:08:33,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:08:33,569 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] [2025-01-09 21:08:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:08:33,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:08:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:08:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1135681530, now seen corresponding path program 1 times [2025-01-09 21:08:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:08:33,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725832119] [2025-01-09 21:08:33,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:08:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:08:33,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:08:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:08:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:08:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:08:33,608 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:08:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:08:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725832119] [2025-01-09 21:08:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725832119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:08:33,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:08:33,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:08:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644042261] [2025-01-09 21:08:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:08:33,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:08:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:08:33,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:08:33,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:08:33,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 280 [2025-01-09 21:08:33,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 327 transitions, 1278 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:08:33,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:08:33,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 280 [2025-01-09 21:08:33,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand