./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:16:48,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:16:48,828 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:16:48,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:16:48,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:16:48,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:16:48,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:16:48,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:16:48,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:16:48,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:16:48,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:16:48,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:16:48,858 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:16:48,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:16:48,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:48,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:48,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:48,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:16:48,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:16:48,860 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-01-09 21:16:49,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:16:49,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:16:49,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:16:49,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:16:49,086 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:16:49,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-01-09 21:16:50,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b620f00/2efb5e5c35f34616a3e177f85a25ce16/FLAG01b7588e9 [2025-01-09 21:16:50,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:16:50,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-01-09 21:16:50,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b620f00/2efb5e5c35f34616a3e177f85a25ce16/FLAG01b7588e9 [2025-01-09 21:16:50,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b620f00/2efb5e5c35f34616a3e177f85a25ce16 [2025-01-09 21:16:50,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:16:50,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:16:50,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:50,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:16:50,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:16:50,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:50" (1/1) ... [2025-01-09 21:16:50,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2121aaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:50, skipping insertion in model container [2025-01-09 21:16:50,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:50" (1/1) ... [2025-01-09 21:16:50,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:16:50,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:50,955 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:16:51,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:51,033 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:16:51,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51 WrapperNode [2025-01-09 21:16:51,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:51,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:51,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:16:51,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:16:51,040 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:16:51" (1/1) ... [2025-01-09 21:16:51,049 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:16:51" (1/1) ... [2025-01-09 21:16:51,061 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-01-09 21:16:51,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:51,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:16:51,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:16:51,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:16:51,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:16:51,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:16:51,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:16:51,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:16:51,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (1/1) ... [2025-01-09 21:16:51,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:16:51,117 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:16:51,124 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:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-09 21:16:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:16:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:16:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:16:51,138 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:16:51,236 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:16:51,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:16:51,412 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:16:51,413 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:16:51,439 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:16:51,440 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:16:51,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:51 BoogieIcfgContainer [2025-01-09 21:16:51,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:16:51,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:16:51,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:16:51,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:16:51,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:16:50" (1/3) ... [2025-01-09 21:16:51,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cde4240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:51, skipping insertion in model container [2025-01-09 21:16:51,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:51" (2/3) ... [2025-01-09 21:16:51,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cde4240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:51, skipping insertion in model container [2025-01-09 21:16:51,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:51" (3/3) ... [2025-01-09 21:16:51,451 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-01-09 21:16:51,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:16:51,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 138 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-01-09 21:16:51,467 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:16:51,529 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:51,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 294 flow [2025-01-09 21:16:51,614 INFO L124 PetriNetUnfolderBase]: 7/153 cut-off events. [2025-01-09 21:16:51,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:51,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 153 events. 7/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-01-09 21:16:51,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 294 flow [2025-01-09 21:16:51,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 294 flow [2025-01-09 21:16:51,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:51,646 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;@c3515bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:51,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:16:51,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:51,655 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:16:51,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:51,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:51,656 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] [2025-01-09 21:16:51,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -32974941, now seen corresponding path program 1 times [2025-01-09 21:16:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:51,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338020655] [2025-01-09 21:16:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:51,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:16:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:16:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:51,838 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:16:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338020655] [2025-01-09 21:16:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338020655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946158724] [2025-01-09 21:16:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:51,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:51,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:51,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:51,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 145 [2025-01-09 21:16:51,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:51,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:51,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 145 [2025-01-09 21:16:51,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:51,958 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2025-01-09 21:16:51,958 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:51,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 76. Up to 11 conditions per place. [2025-01-09 21:16:51,964 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-01-09 21:16:51,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 296 flow [2025-01-09 21:16:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-01-09 21:16:51,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-01-09 21:16:51,978 INFO L175 Difference]: Start difference. First operand has 141 places, 145 transitions, 294 flow. Second operand 3 states and 395 transitions. [2025-01-09 21:16:51,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 296 flow [2025-01-09 21:16:51,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:51,985 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-01-09 21:16:51,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-01-09 21:16:51,991 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -6 predicate places. [2025-01-09 21:16:51,991 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-01-09 21:16:51,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:51,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:51,992 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:16:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:16:51,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 879548329, now seen corresponding path program 1 times [2025-01-09 21:16:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502286525] [2025-01-09 21:16:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:16:52,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:16:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:52,082 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:16:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502286525] [2025-01-09 21:16:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502286525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91312532] [2025-01-09 21:16:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:52,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2025-01-09 21:16:52,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:16:52,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2025-01-09 21:16:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:52,173 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2025-01-09 21:16:52,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 135 events. 4/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2025-01-09 21:16:52,174 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-01-09 21:16:52,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 298 flow [2025-01-09 21:16:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-01-09 21:16:52,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-01-09 21:16:52,179 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 389 transitions. [2025-01-09 21:16:52,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 298 flow [2025-01-09 21:16:52,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:52,185 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 272 flow [2025-01-09 21:16:52,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-01-09 21:16:52,186 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-01-09 21:16:52,186 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 272 flow [2025-01-09 21:16:52,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:16:52,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,186 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] [2025-01-09 21:16:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:16:52,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -34618372, now seen corresponding path program 1 times [2025-01-09 21:16:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-01-09 21:16:52,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:16:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:16:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:52,249 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:16:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:52,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-01-09 21:16:52,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209779595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:52,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:52,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831954886] [2025-01-09 21:16:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:52,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:52,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:52,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:52,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 145 [2025-01-09 21:16:52,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:16:52,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:52,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 145 [2025-01-09 21:16:52,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:52,306 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2025-01-09 21:16:52,307 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:52,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 130 events. 4/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2025-01-09 21:16:52,308 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 13 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2025-01-09 21:16:52,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 290 flow [2025-01-09 21:16:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-01-09 21:16:52,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781609195402299 [2025-01-09 21:16:52,309 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 272 flow. Second operand 3 states and 382 transitions. [2025-01-09 21:16:52,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 290 flow [2025-01-09 21:16:52,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:52,312 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 260 flow [2025-01-09 21:16:52,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-01-09 21:16:52,313 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-01-09 21:16:52,313 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 260 flow [2025-01-09 21:16:52,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:16:52,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:52,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:16:52,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:52,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 974136985, now seen corresponding path program 1 times [2025-01-09 21:16:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443143684] [2025-01-09 21:16:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:16:52,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:16:52,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:52,387 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:16:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443143684] [2025-01-09 21:16:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443143684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938203257] [2025-01-09 21:16:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:52,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:52,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:52,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:52,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 145 [2025-01-09 21:16:52,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:16:52,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:52,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 145 [2025-01-09 21:16:52,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:52,432 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-01-09 21:16:52,433 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:52,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 4/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-01-09 21:16:52,435 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 7 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-01-09 21:16:52,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 276 flow [2025-01-09 21:16:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-01-09 21:16:52,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2025-01-09 21:16:52,437 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 260 flow. Second operand 3 states and 397 transitions. [2025-01-09 21:16:52,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 276 flow [2025-01-09 21:16:52,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:52,440 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 261 flow [2025-01-09 21:16:52,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-01-09 21:16:52,442 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-01-09 21:16:52,442 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 261 flow [2025-01-09 21:16:52,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:16:52,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:52,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:16:52,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:52,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2111232250, now seen corresponding path program 1 times [2025-01-09 21:16:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904552859] [2025-01-09 21:16:52,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:16:52,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:16:52,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904552859] [2025-01-09 21:16:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904552859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:52,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:52,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:16:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644687250] [2025-01-09 21:16:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:52,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:16:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:16:52,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:16:52,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 145 [2025-01-09 21:16:52,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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:16:52,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:52,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 145 [2025-01-09 21:16:52,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:52,653 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2025-01-09 21:16:52,653 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 132 events. 3/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2025-01-09 21:16:52,654 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 14 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2025-01-09 21:16:52,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 303 flow [2025-01-09 21:16:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:16:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:16:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-01-09 21:16:52,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744827586206897 [2025-01-09 21:16:52,656 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 261 flow. Second operand 5 states and 634 transitions. [2025-01-09 21:16:52,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 303 flow [2025-01-09 21:16:52,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:52,659 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 261 flow [2025-01-09 21:16:52,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-01-09 21:16:52,659 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-01-09 21:16:52,660 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 261 flow [2025-01-09 21:16:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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:16:52,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:16:52,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:16:52,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1754111199, now seen corresponding path program 1 times [2025-01-09 21:16:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013727282] [2025-01-09 21:16:52,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:16:52,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:16:52,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:52,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:16:52,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:16:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:52,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:52,727 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:52,727 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:16:52,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:16:52,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:16:52,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:16:52,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:16:52,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:16:52,735 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:52,735 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:16:52,777 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:52,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 215 transitions, 440 flow [2025-01-09 21:16:52,804 INFO L124 PetriNetUnfolderBase]: 12/233 cut-off events. [2025-01-09 21:16:52,804 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:52,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 12/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 497 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 154. Up to 3 conditions per place. [2025-01-09 21:16:52,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 215 transitions, 440 flow [2025-01-09 21:16:52,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 215 transitions, 440 flow [2025-01-09 21:16:52,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:52,809 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;@c3515bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:52,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:16:52,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:52,811 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:16:52,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:52,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,811 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] [2025-01-09 21:16:52,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:52,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 918465754, now seen corresponding path program 1 times [2025-01-09 21:16:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-01-09 21:16:52,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:16:52,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:16:52,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:52,843 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:16:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-01-09 21:16:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964632426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406047424] [2025-01-09 21:16:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:52,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:52,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:52,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:52,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2025-01-09 21:16:52,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:16:52,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:52,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2025-01-09 21:16:52,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:52,980 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2025-01-09 21:16:52,980 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:16:52,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 670 events. 70/670 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3830 event pairs, 42 based on Foata normal form. 84/639 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-01-09 21:16:52,985 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 17 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-01-09 21:16:52,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 448 flow [2025-01-09 21:16:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-01-09 21:16:52,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054263565891473 [2025-01-09 21:16:52,987 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 440 flow. Second operand 3 states and 584 transitions. [2025-01-09 21:16:52,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 448 flow [2025-01-09 21:16:52,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:52,990 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 412 flow [2025-01-09 21:16:52,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-01-09 21:16:52,993 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2025-01-09 21:16:52,993 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 412 flow [2025-01-09 21:16:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:16:52,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:52,994 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:16:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:16:52,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1246130889, now seen corresponding path program 1 times [2025-01-09 21:16:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-01-09 21:16:52,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:16:53,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:16:53,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,018 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:16:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018267300] [2025-01-09 21:16:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018267300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304737607] [2025-01-09 21:16:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-01-09 21:16:53,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:16:53,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-01-09 21:16:53,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,129 INFO L124 PetriNetUnfolderBase]: 42/526 cut-off events. [2025-01-09 21:16:53,130 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:16:53,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 526 events. 42/526 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2574 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 576. Up to 57 conditions per place. [2025-01-09 21:16:53,135 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-01-09 21:16:53,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 446 flow [2025-01-09 21:16:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-01-09 21:16:53,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2025-01-09 21:16:53,137 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2025-01-09 21:16:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 446 flow [2025-01-09 21:16:53,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,140 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 410 flow [2025-01-09 21:16:53,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-01-09 21:16:53,142 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-01-09 21:16:53,142 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 410 flow [2025-01-09 21:16:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:16:53,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,143 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] [2025-01-09 21:16:53,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:16:53,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:53,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash 162254044, now seen corresponding path program 1 times [2025-01-09 21:16:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386327366] [2025-01-09 21:16:53,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:16:53,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:16:53,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,170 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:16:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386327366] [2025-01-09 21:16:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386327366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159051862] [2025-01-09 21:16:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 215 [2025-01-09 21:16:53,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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:16:53,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 215 [2025-01-09 21:16:53,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,296 INFO L124 PetriNetUnfolderBase]: 82/808 cut-off events. [2025-01-09 21:16:53,296 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:16:53,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 808 events. 82/808 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4770 event pairs, 42 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 109 conditions per place. [2025-01-09 21:16:53,302 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2025-01-09 21:16:53,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 438 flow [2025-01-09 21:16:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-01-09 21:16:53,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-01-09 21:16:53,304 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 410 flow. Second operand 3 states and 565 transitions. [2025-01-09 21:16:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 438 flow [2025-01-09 21:16:53,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 191 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,307 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 394 flow [2025-01-09 21:16:53,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2025-01-09 21:16:53,309 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-01-09 21:16:53,310 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 394 flow [2025-01-09 21:16:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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:16:53,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:16:53,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:53,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1937057401, now seen corresponding path program 1 times [2025-01-09 21:16:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316176674] [2025-01-09 21:16:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:16:53,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:16:53,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,357 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:16:53,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316176674] [2025-01-09 21:16:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316176674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038493657] [2025-01-09 21:16:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 215 [2025-01-09 21:16:53,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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:16:53,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 215 [2025-01-09 21:16:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,424 INFO L124 PetriNetUnfolderBase]: 31/442 cut-off events. [2025-01-09 21:16:53,424 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:16:53,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 442 events. 31/442 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1847 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 459. Up to 36 conditions per place. [2025-01-09 21:16:53,427 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-01-09 21:16:53,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 418 flow [2025-01-09 21:16:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-01-09 21:16:53,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2025-01-09 21:16:53,429 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 394 flow. Second operand 3 states and 590 transitions. [2025-01-09 21:16:53,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 418 flow [2025-01-09 21:16:53,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:53,431 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 395 flow [2025-01-09 21:16:53,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-01-09 21:16:53,432 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-01-09 21:16:53,432 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 395 flow [2025-01-09 21:16:53,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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:16:53,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:53,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:16:53,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:53,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1058265087, now seen corresponding path program 1 times [2025-01-09 21:16:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772170553] [2025-01-09 21:16:53,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:16:53,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:16:53,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,486 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:16:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772170553] [2025-01-09 21:16:53,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772170553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024377855] [2025-01-09 21:16:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 215 [2025-01-09 21:16:53,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:16:53,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 215 [2025-01-09 21:16:53,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,662 INFO L124 PetriNetUnfolderBase]: 195/1595 cut-off events. [2025-01-09 21:16:53,662 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:16:53,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1595 events. 195/1595 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12522 event pairs, 57 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1885. Up to 204 conditions per place. [2025-01-09 21:16:53,672 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 32 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-01-09 21:16:53,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 530 flow [2025-01-09 21:16:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-01-09 21:16:53,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178294573643411 [2025-01-09 21:16:53,674 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 395 flow. Second operand 3 states and 592 transitions. [2025-01-09 21:16:53,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 209 transitions, 530 flow [2025-01-09 21:16:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,678 INFO L231 Difference]: Finished difference. Result has 193 places, 204 transitions, 515 flow [2025-01-09 21:16:53,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=193, PETRI_TRANSITIONS=204} [2025-01-09 21:16:53,679 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2025-01-09 21:16:53,679 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 204 transitions, 515 flow [2025-01-09 21:16:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:16:53,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,679 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:53,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:16:53,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:53,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1542366357, now seen corresponding path program 1 times [2025-01-09 21:16:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548621620] [2025-01-09 21:16:53,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:16:53,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:16:53,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,767 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:16:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548621620] [2025-01-09 21:16:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548621620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:16:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337057328] [2025-01-09 21:16:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:16:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:16:53,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:16:53,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-01-09 21:16:53,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 204 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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:16:53,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-01-09 21:16:53,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,957 INFO L124 PetriNetUnfolderBase]: 130/1492 cut-off events. [2025-01-09 21:16:53,957 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:16:53,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1492 events. 130/1492 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11584 event pairs, 41 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1724. Up to 120 conditions per place. [2025-01-09 21:16:53,968 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 17 selfloop transitions, 0 changer transitions 4/207 dead transitions. [2025-01-09 21:16:53,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 207 transitions, 563 flow [2025-01-09 21:16:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:16:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:16:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2025-01-09 21:16:53,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8902325581395348 [2025-01-09 21:16:53,970 INFO L175 Difference]: Start difference. First operand has 193 places, 204 transitions, 515 flow. Second operand 5 states and 957 transitions. [2025-01-09 21:16:53,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 207 transitions, 563 flow [2025-01-09 21:16:53,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,975 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 491 flow [2025-01-09 21:16:53,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2025-01-09 21:16:53,976 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-01-09 21:16:53,976 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 491 flow [2025-01-09 21:16:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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:16:53,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,977 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:16:53,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:16:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash 825477669, now seen corresponding path program 1 times [2025-01-09 21:16:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547325154] [2025-01-09 21:16:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:16:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:16:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:53,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:16:54,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:16:54,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:54,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:54,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:54,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-01-09 21:16:54,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-01-09 21:16:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-01-09 21:16:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-01-09 21:16:54,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-01-09 21:16:54,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-01-09 21:16:54,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-01-09 21:16:54,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-01-09 21:16:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:16:54,016 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:54,017 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:54,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:16:54,057 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 285 transitions, 588 flow [2025-01-09 21:16:54,089 INFO L124 PetriNetUnfolderBase]: 17/313 cut-off events. [2025-01-09 21:16:54,089 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:16:54,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 17/313 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 946 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 237. Up to 4 conditions per place. [2025-01-09 21:16:54,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 285 transitions, 588 flow [2025-01-09 21:16:54,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 285 transitions, 588 flow [2025-01-09 21:16:54,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:54,095 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;@c3515bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:54,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 21:16:54,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:54,096 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:16:54,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:54,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,097 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] [2025-01-09 21:16:54,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 281901591, now seen corresponding path program 1 times [2025-01-09 21:16:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035828360] [2025-01-09 21:16:54,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:16:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:16:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,112 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:16:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035828360] [2025-01-09 21:16:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035828360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464385799] [2025-01-09 21:16:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 285 [2025-01-09 21:16:54,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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:16:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 285 [2025-01-09 21:16:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,547 INFO L124 PetriNetUnfolderBase]: 829/4689 cut-off events. [2025-01-09 21:16:54,547 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-01-09 21:16:54,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 4689 events. 829/4689 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 48218 event pairs, 630 based on Foata normal form. 685/4575 useless extension candidates. Maximal degree in co-relation 4862. Up to 1033 conditions per place. [2025-01-09 21:16:54,639 INFO L140 encePairwiseOnDemand]: 274/285 looper letters, 24 selfloop transitions, 2 changer transitions 1/266 dead transitions. [2025-01-09 21:16:54,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2025-01-09 21:16:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-01-09 21:16:54,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904093567251462 [2025-01-09 21:16:54,642 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 588 flow. Second operand 3 states and 773 transitions. [2025-01-09 21:16:54,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2025-01-09 21:16:54,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:54,646 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-01-09 21:16:54,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-01-09 21:16:54,646 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -10 predicate places. [2025-01-09 21:16:54,646 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-01-09 21:16:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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:16:54,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,647 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:16:54,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:16:54,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:54,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1863720663, now seen corresponding path program 1 times [2025-01-09 21:16:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-01-09 21:16:54,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:16:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:16:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,663 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:16:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-01-09 21:16:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017321033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122460051] [2025-01-09 21:16:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 285 [2025-01-09 21:16:54,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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:16:54,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 285 [2025-01-09 21:16:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,896 INFO L124 PetriNetUnfolderBase]: 335/2597 cut-off events. [2025-01-09 21:16:54,896 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-01-09 21:16:54,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 2597 events. 335/2597 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23493 event pairs, 220 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3047. Up to 382 conditions per place. [2025-01-09 21:16:54,921 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-01-09 21:16:54,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 594 flow [2025-01-09 21:16:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-01-09 21:16:54,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017543859649123 [2025-01-09 21:16:54,923 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 771 transitions. [2025-01-09 21:16:54,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 594 flow [2025-01-09 21:16:54,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:54,926 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 548 flow [2025-01-09 21:16:54,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-01-09 21:16:54,927 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -12 predicate places. [2025-01-09 21:16:54,927 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 548 flow [2025-01-09 21:16:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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:16:54,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,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, 1, 1, 1, 1, 1] [2025-01-09 21:16:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:16:54,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1521937020, now seen corresponding path program 1 times [2025-01-09 21:16:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085645555] [2025-01-09 21:16:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:16:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:16:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,946 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:16:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085645555] [2025-01-09 21:16:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085645555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107808755] [2025-01-09 21:16:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-01-09 21:16:54,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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:16:54,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-01-09 21:16:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:55,543 INFO L124 PetriNetUnfolderBase]: 985/6367 cut-off events. [2025-01-09 21:16:55,544 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-01-09 21:16:55,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7666 conditions, 6367 events. 985/6367 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69496 event pairs, 630 based on Foata normal form. 0/5355 useless extension candidates. Maximal degree in co-relation 7625. Up to 1120 conditions per place. [2025-01-09 21:16:55,590 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 27 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-01-09 21:16:55,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 586 flow [2025-01-09 21:16:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-01-09 21:16:55,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2025-01-09 21:16:55,593 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 548 flow. Second operand 3 states and 748 transitions. [2025-01-09 21:16:55,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 586 flow [2025-01-09 21:16:55,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:55,596 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 528 flow [2025-01-09 21:16:55,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-01-09 21:16:55,597 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-01-09 21:16:55,597 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 528 flow [2025-01-09 21:16:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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:16:55,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:55,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:16:55,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:55,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash -182533863, now seen corresponding path program 1 times [2025-01-09 21:16:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071382031] [2025-01-09 21:16:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:16:55,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:16:55,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:55,622 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:16:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071382031] [2025-01-09 21:16:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071382031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984276992] [2025-01-09 21:16:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:55,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 285 [2025-01-09 21:16:55,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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:16:55,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:55,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 285 [2025-01-09 21:16:55,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:55,819 INFO L124 PetriNetUnfolderBase]: 190/1767 cut-off events. [2025-01-09 21:16:55,820 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-09 21:16:55,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1767 events. 190/1767 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13793 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1992. Up to 196 conditions per place. [2025-01-09 21:16:55,838 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-01-09 21:16:55,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 560 flow [2025-01-09 21:16:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-01-09 21:16:55,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-01-09 21:16:55,840 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 528 flow. Second operand 3 states and 783 transitions. [2025-01-09 21:16:55,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 560 flow [2025-01-09 21:16:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:55,844 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 529 flow [2025-01-09 21:16:55,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2025-01-09 21:16:55,845 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-01-09 21:16:55,845 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 529 flow [2025-01-09 21:16:55,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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:16:55,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:55,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:16:55,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:55,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash -708393806, now seen corresponding path program 1 times [2025-01-09 21:16:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573843517] [2025-01-09 21:16:55,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:16:55,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:16:55,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:55,876 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:16:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573843517] [2025-01-09 21:16:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573843517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607069911] [2025-01-09 21:16:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:55,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:55,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:55,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2025-01-09 21:16:55,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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:16:55,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:55,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2025-01-09 21:16:55,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:57,798 INFO L124 PetriNetUnfolderBase]: 4660/23982 cut-off events. [2025-01-09 21:16:57,799 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-09 21:16:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 23982 events. 4660/23982 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 330791 event pairs, 1667 based on Foata normal form. 0/20559 useless extension candidates. Maximal degree in co-relation 30400. Up to 4132 conditions per place. [2025-01-09 21:16:58,012 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 48 selfloop transitions, 21 changer transitions 0/283 dead transitions. [2025-01-09 21:16:58,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 283 transitions, 735 flow [2025-01-09 21:16:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:16:58,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-01-09 21:16:58,015 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 529 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:16:58,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 283 transitions, 735 flow [2025-01-09 21:16:58,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 283 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:58,019 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 711 flow [2025-01-09 21:16:58,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2025-01-09 21:16:58,020 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -19 predicate places. [2025-01-09 21:16:58,020 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 711 flow [2025-01-09 21:16:58,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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:16:58,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:58,021 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:58,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:16:58,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:58,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1555729297, now seen corresponding path program 1 times [2025-01-09 21:16:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310345802] [2025-01-09 21:16:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:58,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:16:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:16:58,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:58,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:58,089 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:16:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310345802] [2025-01-09 21:16:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310345802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:16:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581710413] [2025-01-09 21:16:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:16:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:16:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:16:58,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2025-01-09 21:16:58,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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:16:58,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:58,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2025-01-09 21:16:58,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:58,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [132#L1045-2true, Black: 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 47#$Ultimate##0true, 276#true, 274#true, 56#L1060-3true, 290#true, 272#true, 202#L1045-2true, 295#true]) [2025-01-09 21:16:58,860 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-01-09 21:16:58,861 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:16:58,861 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-01-09 21:16:58,861 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-01-09 21:16:59,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [69#L1040-3true, 132#L1045-2true, Black: 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 56#L1060-3true, 290#true, 272#true, 202#L1045-2true, 295#true]) [2025-01-09 21:16:59,043 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-01-09 21:16:59,043 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:16:59,044 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:16:59,044 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-01-09 21:16:59,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][161], [132#L1045-2true, 227#L1045-2true, Black: 290#true, 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 244#L1043-6true, 56#L1060-3true, 272#true, 295#true]) [2025-01-09 21:16:59,246 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-01-09 21:16:59,246 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:16:59,246 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:16:59,246 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-01-09 21:16:59,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [227#L1045-2true, 132#L1045-2true, Black: 292#(= |#race~next~0| 0), 276#true, 274#true, 286#(= |#race~len~0| 0), 56#L1060-3true, 290#true, 272#true, 202#L1045-2true, 295#true]) [2025-01-09 21:16:59,271 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-01-09 21:16:59,271 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:16:59,271 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:16:59,271 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-01-09 21:16:59,537 INFO L124 PetriNetUnfolderBase]: 2516/17384 cut-off events. [2025-01-09 21:16:59,537 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-01-09 21:16:59,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 17384 events. 2516/17384 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 237555 event pairs, 1056 based on Foata normal form. 1/15063 useless extension candidates. Maximal degree in co-relation 21863. Up to 2203 conditions per place. [2025-01-09 21:16:59,670 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 20 selfloop transitions, 0 changer transitions 4/278 dead transitions. [2025-01-09 21:16:59,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 278 transitions, 765 flow [2025-01-09 21:16:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:16:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:16:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-01-09 21:16:59,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2025-01-09 21:16:59,833 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 711 flow. Second operand 5 states and 1280 transitions. [2025-01-09 21:16:59,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 278 transitions, 765 flow [2025-01-09 21:16:59,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 278 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:59,855 INFO L231 Difference]: Finished difference. Result has 261 places, 274 transitions, 673 flow [2025-01-09 21:16:59,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2025-01-09 21:16:59,855 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -14 predicate places. [2025-01-09 21:16:59,856 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 673 flow [2025-01-09 21:16:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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:16:59,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:59,856 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:16:59,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:16:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1150148804, now seen corresponding path program 1 times [2025-01-09 21:16:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330502402] [2025-01-09 21:16:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:59,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:16:59,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:16:59,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:59,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:59,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:59,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:16:59,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:16:59,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:59,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:59,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:59,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:59,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-01-09 21:16:59,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-01-09 21:16:59,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-01-09 21:16:59,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-01-09 21:16:59,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-01-09 21:16:59,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-01-09 21:16:59,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-01-09 21:16:59,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-01-09 21:16:59,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-01-09 21:16:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:16:59,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:59,890 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:59,890 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:16:59,922 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:59,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 355 transitions, 738 flow [2025-01-09 21:16:59,951 INFO L124 PetriNetUnfolderBase]: 22/393 cut-off events. [2025-01-09 21:16:59,951 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:16:59,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 393 events. 22/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1408 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 321. Up to 5 conditions per place. [2025-01-09 21:16:59,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 355 transitions, 738 flow [2025-01-09 21:16:59,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 355 transitions, 738 flow [2025-01-09 21:16:59,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:59,958 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;@c3515bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:59,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-09 21:16:59,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:59,959 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:16:59,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:59,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:59,959 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] [2025-01-09 21:16:59,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:16:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1942667430, now seen corresponding path program 1 times [2025-01-09 21:16:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769177509] [2025-01-09 21:16:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:59,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:16:59,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:16:59,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:59,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:59,975 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:16:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769177509] [2025-01-09 21:16:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769177509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:59,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811911455] [2025-01-09 21:16:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:59,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:59,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:59,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:00,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 355 [2025-01-09 21:17:00,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 355 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:17:00,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:00,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 355 [2025-01-09 21:17:00,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:03,260 INFO L124 PetriNetUnfolderBase]: 8203/34874 cut-off events. [2025-01-09 21:17:03,260 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-01-09 21:17:03,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46423 conditions, 34874 events. 8203/34874 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 484626 event pairs, 6804 based on Foata normal form. 5566/34841 useless extension candidates. Maximal degree in co-relation 38089. Up to 9608 conditions per place. [2025-01-09 21:17:03,620 INFO L140 encePairwiseOnDemand]: 342/355 looper letters, 31 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2025-01-09 21:17:03,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 332 transitions, 758 flow [2025-01-09 21:17:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-01-09 21:17:03,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-01-09 21:17:03,622 INFO L175 Difference]: Start difference. First operand has 342 places, 355 transitions, 738 flow. Second operand 3 states and 962 transitions. [2025-01-09 21:17:03,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 332 transitions, 758 flow [2025-01-09 21:17:03,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 332 transitions, 752 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:03,626 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 688 flow [2025-01-09 21:17:03,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-01-09 21:17:03,626 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -12 predicate places. [2025-01-09 21:17:03,626 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 688 flow [2025-01-09 21:17:03,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:17:03,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:03,627 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:17:03,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:17:03,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:17:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 139928265, now seen corresponding path program 1 times [2025-01-09 21:17:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842881161] [2025-01-09 21:17:03,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:03,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:17:03,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:17:03,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:03,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:03,641 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:17:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:03,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842881161] [2025-01-09 21:17:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842881161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214780923] [2025-01-09 21:17:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:03,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:03,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:03,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 355 [2025-01-09 21:17:03,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:17:03,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:03,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 355 [2025-01-09 21:17:03,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:04,826 INFO L124 PetriNetUnfolderBase]: 2303/13468 cut-off events. [2025-01-09 21:17:04,826 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-01-09 21:17:04,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 13468 events. 2303/13468 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 168738 event pairs, 1720 based on Foata normal form. 0/11135 useless extension candidates. Maximal degree in co-relation 16418. Up to 2507 conditions per place. [2025-01-09 21:17:05,024 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-01-09 21:17:05,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 742 flow [2025-01-09 21:17:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-01-09 21:17:05,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-01-09 21:17:05,027 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 688 flow. Second operand 3 states and 962 transitions. [2025-01-09 21:17:05,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 742 flow [2025-01-09 21:17:05,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:05,030 INFO L231 Difference]: Finished difference. Result has 328 places, 330 transitions, 686 flow [2025-01-09 21:17:05,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=328, PETRI_TRANSITIONS=330} [2025-01-09 21:17:05,033 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -14 predicate places. [2025-01-09 21:17:05,033 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 330 transitions, 686 flow [2025-01-09 21:17:05,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:17:05,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:05,033 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] [2025-01-09 21:17:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:17:05,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:17:05,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash -250536740, now seen corresponding path program 1 times [2025-01-09 21:17:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112030957] [2025-01-09 21:17:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:05,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:17:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:17:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:05,058 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:17:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112030957] [2025-01-09 21:17:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112030957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592195552] [2025-01-09 21:17:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:05,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:05,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:05,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 355 [2025-01-09 21:17:05,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 330 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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:17:05,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:05,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 355 [2025-01-09 21:17:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,139 INFO L124 PetriNetUnfolderBase]: 9761/49199 cut-off events. [2025-01-09 21:17:10,139 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-01-09 21:17:10,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 49199 events. 9761/49199 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 737366 event pairs, 6804 based on Foata normal form. 0/41396 useless extension candidates. Maximal degree in co-relation 60964. Up to 10598 conditions per place. [2025-01-09 21:17:10,749 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 34 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2025-01-09 21:17:10,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 734 flow [2025-01-09 21:17:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-01-09 21:17:10,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741784037558685 [2025-01-09 21:17:10,750 INFO L175 Difference]: Start difference. First operand has 328 places, 330 transitions, 686 flow. Second operand 3 states and 931 transitions. [2025-01-09 21:17:10,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 734 flow [2025-01-09 21:17:10,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 319 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:10,754 INFO L231 Difference]: Finished difference. Result has 317 places, 319 transitions, 662 flow [2025-01-09 21:17:10,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=317, PETRI_TRANSITIONS=319} [2025-01-09 21:17:10,755 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-01-09 21:17:10,755 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 662 flow [2025-01-09 21:17:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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:17:10,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:10,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:17:10,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:17:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1089669511, now seen corresponding path program 1 times [2025-01-09 21:17:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015326092] [2025-01-09 21:17:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:10,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:17:10,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:17:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:10,778 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:17:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015326092] [2025-01-09 21:17:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015326092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500119680] [2025-01-09 21:17:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:10,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:10,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:10,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:10,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 355 [2025-01-09 21:17:10,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:17:10,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:10,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 355 [2025-01-09 21:17:10,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:11,543 INFO L124 PetriNetUnfolderBase]: 1021/7284 cut-off events. [2025-01-09 21:17:11,544 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:17:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 7284 events. 1021/7284 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 80299 event pairs, 684 based on Foata normal form. 0/6099 useless extension candidates. Maximal degree in co-relation 8533. Up to 1028 conditions per place. [2025-01-09 21:17:11,606 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 19 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-01-09 21:17:11,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 702 flow [2025-01-09 21:17:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-01-09 21:17:11,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164319248826291 [2025-01-09 21:17:11,608 INFO L175 Difference]: Start difference. First operand has 317 places, 319 transitions, 662 flow. Second operand 3 states and 976 transitions. [2025-01-09 21:17:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 702 flow [2025-01-09 21:17:11,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:11,611 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 663 flow [2025-01-09 21:17:11,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-01-09 21:17:11,612 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-01-09 21:17:11,612 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 663 flow [2025-01-09 21:17:11,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:17:11,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:11,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:17:11,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:17:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1060849808, now seen corresponding path program 1 times [2025-01-09 21:17:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834499518] [2025-01-09 21:17:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:11,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:17:11,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:17:11,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:11,641 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:17:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834499518] [2025-01-09 21:17:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834499518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200964033] [2025-01-09 21:17:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:11,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:11,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:11,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 355 [2025-01-09 21:17:11,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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:17:11,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:11,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 355 [2025-01-09 21:17:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand