./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.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-race-challenges/thread-join-array-dynamic-race-2.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 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:38:03,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:38:03,239 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:38:03,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:38:03,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:38:03,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:38:03,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:38:03,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:38:03,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:38:03,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:38:03,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:38:03,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:38:03,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:38:03,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:38:03,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:38:03,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:38:03,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:38:03,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:38:03,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:38:03,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:38:03,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:38:03,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:38:03,265 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 -> 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 [2025-01-09 21:38:03,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:38:03,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:38:03,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:38:03,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:38:03,489 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:38:03,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2025-01-09 21:38:04,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3617aaa70/34fef5c3d60744dab14276331a143464/FLAG6979ceb90 [2025-01-09 21:38:04,941 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:38:04,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2025-01-09 21:38:04,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3617aaa70/34fef5c3d60744dab14276331a143464/FLAG6979ceb90 [2025-01-09 21:38:05,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3617aaa70/34fef5c3d60744dab14276331a143464 [2025-01-09 21:38:05,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:38:05,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:38:05,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:38:05,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:38:05,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:38:05,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734629a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05, skipping insertion in model container [2025-01-09 21:38:05,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:38:05,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:38:05,565 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:38:05,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:38:05,677 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:38:05,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05 WrapperNode [2025-01-09 21:38:05,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:38:05,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:38:05,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:38:05,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:38:05,690 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:38:05" (1/1) ... [2025-01-09 21:38:05,706 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:38:05" (1/1) ... [2025-01-09 21:38:05,732 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-01-09 21:38:05,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:38:05,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:38:05,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:38:05,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:38:05,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:38:05,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:38:05,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:38:05,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:38:05,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (1/1) ... [2025-01-09 21:38:05,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:38:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:38:05,785 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:38:05,790 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:38:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:38:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:38:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:38:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:38:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:38:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:38:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:38:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:38:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:38:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:38:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:38:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:38:05,813 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:38:05,901 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:38:05,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:38:06,067 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:38:06,067 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:38:06,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:38:06,087 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:38:06,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:38:06 BoogieIcfgContainer [2025-01-09 21:38:06,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:38:06,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:38:06,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:38:06,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:38:06,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:38:05" (1/3) ... [2025-01-09 21:38:06,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cb8c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:38:06, skipping insertion in model container [2025-01-09 21:38:06,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:05" (2/3) ... [2025-01-09 21:38:06,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cb8c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:38:06, skipping insertion in model container [2025-01-09 21:38:06,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:38:06" (3/3) ... [2025-01-09 21:38:06,097 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2025-01-09 21:38:06,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:38:06,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic-race-2.i that has 2 procedures, 85 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-09 21:38:06,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:38:06,159 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:38:06,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 181 flow [2025-01-09 21:38:06,232 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2025-01-09 21:38:06,237 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:38:06,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 119 events. 2/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 207 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2025-01-09 21:38:06,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 181 flow [2025-01-09 21:38:06,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 181 flow [2025-01-09 21:38:06,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:38:06,265 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;@1ee730a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:38:06,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 21:38:06,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:38:06,279 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 21:38:06,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:38:06,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:06,280 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:38:06,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash -353120461, now seen corresponding path program 1 times [2025-01-09 21:38:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510279675] [2025-01-09 21:38:06,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:06,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:38:06,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:38:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:06,504 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:38:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510279675] [2025-01-09 21:38:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510279675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701181466] [2025-01-09 21:38:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:06,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 87 [2025-01-09 21:38:06,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:38:06,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:06,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 87 [2025-01-09 21:38:06,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:06,598 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2025-01-09 21:38:06,598 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-01-09 21:38:06,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 161 events. 8/161 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-01-09 21:38:06,600 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 8 selfloop transitions, 3 changer transitions 2/90 dead transitions. [2025-01-09 21:38:06,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 211 flow [2025-01-09 21:38:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-01-09 21:38:06,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501915708812261 [2025-01-09 21:38:06,610 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 181 flow. Second operand 3 states and 248 transitions. [2025-01-09 21:38:06,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 211 flow [2025-01-09 21:38:06,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:38:06,617 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 199 flow [2025-01-09 21:38:06,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2025-01-09 21:38:06,621 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2025-01-09 21:38:06,621 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 199 flow [2025-01-09 21:38:06,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:38:06,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:06,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:06,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:38:06,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:06,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1663195341, now seen corresponding path program 1 times [2025-01-09 21:38:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019986273] [2025-01-09 21:38:06,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:06,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:06,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:06,792 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:38:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019986273] [2025-01-09 21:38:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019986273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523527119] [2025-01-09 21:38:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:38:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:06,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:38:06,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:38:06,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 87 [2025-01-09 21:38:06,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:06,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:06,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 87 [2025-01-09 21:38:06,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:06,931 INFO L124 PetriNetUnfolderBase]: 17/224 cut-off events. [2025-01-09 21:38:06,931 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:38:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 224 events. 17/224 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 773 event pairs, 7 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 215. Up to 49 conditions per place. [2025-01-09 21:38:06,935 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 15 selfloop transitions, 2 changer transitions 5/94 dead transitions. [2025-01-09 21:38:06,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 257 flow [2025-01-09 21:38:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2025-01-09 21:38:06,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601532567049809 [2025-01-09 21:38:06,938 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 199 flow. Second operand 6 states and 449 transitions. [2025-01-09 21:38:06,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 257 flow [2025-01-09 21:38:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:06,942 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 211 flow [2025-01-09 21:38:06,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2025-01-09 21:38:06,943 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 10 predicate places. [2025-01-09 21:38:06,943 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 211 flow [2025-01-09 21:38:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:06,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:06,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:38:06,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:06,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 343818801, now seen corresponding path program 1 times [2025-01-09 21:38:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357663473] [2025-01-09 21:38:06,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:06,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:06,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:06,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:07,331 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:38:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357663473] [2025-01-09 21:38:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357663473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:07,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512601036] [2025-01-09 21:38:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:07,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:07,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:07,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:07,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 87 [2025-01-09 21:38:07,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:38:07,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:07,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 87 [2025-01-09 21:38:07,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:07,537 INFO L124 PetriNetUnfolderBase]: 30/239 cut-off events. [2025-01-09 21:38:07,538 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 21:38:07,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 239 events. 30/239 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1022 event pairs, 5 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 295. Up to 61 conditions per place. [2025-01-09 21:38:07,539 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 24 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2025-01-09 21:38:07,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 283 flow [2025-01-09 21:38:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-01-09 21:38:07,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2025-01-09 21:38:07,541 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 211 flow. Second operand 6 states and 414 transitions. [2025-01-09 21:38:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 283 flow [2025-01-09 21:38:07,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 269 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:07,544 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 205 flow [2025-01-09 21:38:07,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2025-01-09 21:38:07,544 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places. [2025-01-09 21:38:07,545 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 205 flow [2025-01-09 21:38:07,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:38:07,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:07,545 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] [2025-01-09 21:38:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:38:07,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:07,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash -899944315, now seen corresponding path program 1 times [2025-01-09 21:38:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30227044] [2025-01-09 21:38:07,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:38:07,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:38:07,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:07,573 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:38:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30227044] [2025-01-09 21:38:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30227044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676452990] [2025-01-09 21:38:07,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:07,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:07,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:07,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:07,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 87 [2025-01-09 21:38:07,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:38:07,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:07,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 87 [2025-01-09 21:38:07,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:07,606 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2025-01-09 21:38:07,606 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-01-09 21:38:07,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 167 events. 5/167 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 476 event pairs, 3 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 173. Up to 25 conditions per place. [2025-01-09 21:38:07,607 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 8 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2025-01-09 21:38:07,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 241 flow [2025-01-09 21:38:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-01-09 21:38:07,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272030651340997 [2025-01-09 21:38:07,609 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 205 flow. Second operand 3 states and 242 transitions. [2025-01-09 21:38:07,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 241 flow [2025-01-09 21:38:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 231 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:07,611 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 217 flow [2025-01-09 21:38:07,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2025-01-09 21:38:07,612 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-01-09 21:38:07,612 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 217 flow [2025-01-09 21:38:07,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:38:07,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:07,612 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] [2025-01-09 21:38:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:38:07,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:07,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1553796007, now seen corresponding path program 1 times [2025-01-09 21:38:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053450944] [2025-01-09 21:38:07,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:07,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:38:07,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:38:07,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:07,869 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:38:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053450944] [2025-01-09 21:38:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053450944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:07,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:07,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747794018] [2025-01-09 21:38:07,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:07,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:07,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:07,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2025-01-09 21:38:07,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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:38:07,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:07,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2025-01-09 21:38:07,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:07,993 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2025-01-09 21:38:07,993 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-01-09 21:38:07,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 280 events. 25/280 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1217 event pairs, 15 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-01-09 21:38:07,994 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 12 selfloop transitions, 0 changer transitions 18/93 dead transitions. [2025-01-09 21:38:07,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 285 flow [2025-01-09 21:38:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2025-01-09 21:38:07,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8122605363984674 [2025-01-09 21:38:07,996 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 217 flow. Second operand 6 states and 424 transitions. [2025-01-09 21:38:07,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 285 flow [2025-01-09 21:38:07,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:07,998 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 184 flow [2025-01-09 21:38:07,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2025-01-09 21:38:07,999 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 7 predicate places. [2025-01-09 21:38:07,999 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 184 flow [2025-01-09 21:38:07,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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:38:07,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:07,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:07,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:38:08,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-01-09 21:38:08,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1322930874, now seen corresponding path program 1 times [2025-01-09 21:38:08,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:08,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127234985] [2025-01-09 21:38:08,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:08,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:08,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:38:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:38:08,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:08,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:08,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:38:08,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:38:08,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:38:08,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:08,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:08,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:38:08,044 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:38:08,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 21:38:08,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-01-09 21:38:08,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-01-09 21:38:08,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-01-09 21:38:08,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-01-09 21:38:08,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-01-09 21:38:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:38:08,048 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:38:08,050 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:38:08,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:38:08,068 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:38:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 226 flow [2025-01-09 21:38:08,091 INFO L124 PetriNetUnfolderBase]: 4/199 cut-off events. [2025-01-09 21:38:08,091 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:38:08,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 199 events. 4/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 419 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2025-01-09 21:38:08,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 105 transitions, 226 flow [2025-01-09 21:38:08,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 226 flow [2025-01-09 21:38:08,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:38:08,094 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;@1ee730a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:38:08,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:38:08,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:38:08,098 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 21:38:08,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:38:08,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:08,098 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:38:08,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -756388269, now seen corresponding path program 1 times [2025-01-09 21:38:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906047155] [2025-01-09 21:38:08,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:38:08,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:38:08,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:08,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:08,120 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:38:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906047155] [2025-01-09 21:38:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906047155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597585767] [2025-01-09 21:38:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:08,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:08,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:08,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:08,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2025-01-09 21:38:08,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:38:08,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:08,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2025-01-09 21:38:08,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:08,250 INFO L124 PetriNetUnfolderBase]: 119/719 cut-off events. [2025-01-09 21:38:08,250 INFO L125 PetriNetUnfolderBase]: For 68/92 co-relation queries the response was YES. [2025-01-09 21:38:08,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 719 events. 119/719 cut-off events. For 68/92 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4211 event pairs, 50 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2025-01-09 21:38:08,259 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 16 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2025-01-09 21:38:08,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 278 flow [2025-01-09 21:38:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2025-01-09 21:38:08,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365079365079365 [2025-01-09 21:38:08,262 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 226 flow. Second operand 3 states and 295 transitions. [2025-01-09 21:38:08,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 111 transitions, 278 flow [2025-01-09 21:38:08,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:38:08,264 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2025-01-09 21:38:08,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-01-09 21:38:08,265 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2025-01-09 21:38:08,265 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2025-01-09 21:38:08,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:38:08,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:08,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:38:08,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 669891853, now seen corresponding path program 1 times [2025-01-09 21:38:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265711949] [2025-01-09 21:38:08,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:08,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:08,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:08,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:08,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:08,328 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:38:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265711949] [2025-01-09 21:38:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265711949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945043186] [2025-01-09 21:38:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:08,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:38:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:08,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:38:08,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:38:08,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2025-01-09 21:38:08,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:38:08,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:08,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2025-01-09 21:38:08,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:08,568 INFO L124 PetriNetUnfolderBase]: 187/1181 cut-off events. [2025-01-09 21:38:08,568 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-09 21:38:08,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1181 events. 187/1181 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8537 event pairs, 130 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 1078. Up to 312 conditions per place. [2025-01-09 21:38:08,574 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 20 selfloop transitions, 2 changer transitions 5/114 dead transitions. [2025-01-09 21:38:08,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 114 transitions, 322 flow [2025-01-09 21:38:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2025-01-09 21:38:08,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539682539682539 [2025-01-09 21:38:08,580 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 538 transitions. [2025-01-09 21:38:08,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 114 transitions, 322 flow [2025-01-09 21:38:08,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:08,585 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 266 flow [2025-01-09 21:38:08,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2025-01-09 21:38:08,586 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 10 predicate places. [2025-01-09 21:38:08,586 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 266 flow [2025-01-09 21:38:08,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:38:08,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:08,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:08,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:38:08,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:08,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -649484687, now seen corresponding path program 1 times [2025-01-09 21:38:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160623449] [2025-01-09 21:38:08,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:08,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:08,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:08,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:08,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:08,768 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:38:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160623449] [2025-01-09 21:38:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160623449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009372805] [2025-01-09 21:38:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:08,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:08,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:08,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2025-01-09 21:38:08,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:38:08,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:08,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2025-01-09 21:38:08,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:08,980 INFO L124 PetriNetUnfolderBase]: 298/1303 cut-off events. [2025-01-09 21:38:08,980 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-01-09 21:38:09,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1303 events. 298/1303 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9892 event pairs, 57 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 1806. Up to 371 conditions per place. [2025-01-09 21:38:09,016 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 37 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-01-09 21:38:09,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 122 transitions, 380 flow [2025-01-09 21:38:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2025-01-09 21:38:09,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-01-09 21:38:09,017 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 266 flow. Second operand 6 states and 510 transitions. [2025-01-09 21:38:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 122 transitions, 380 flow [2025-01-09 21:38:09,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 368 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 21:38:09,020 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 262 flow [2025-01-09 21:38:09,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2025-01-09 21:38:09,020 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 7 predicate places. [2025-01-09 21:38:09,020 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 262 flow [2025-01-09 21:38:09,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:38:09,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:09,021 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] [2025-01-09 21:38:09,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:38:09,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:09,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash 706644053, now seen corresponding path program 1 times [2025-01-09 21:38:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225636389] [2025-01-09 21:38:09,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:09,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:38:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:38:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:09,046 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:38:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225636389] [2025-01-09 21:38:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225636389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765383752] [2025-01-09 21:38:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:09,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:09,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 105 [2025-01-09 21:38:09,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:38:09,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:09,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 105 [2025-01-09 21:38:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:09,136 INFO L124 PetriNetUnfolderBase]: 165/981 cut-off events. [2025-01-09 21:38:09,137 INFO L125 PetriNetUnfolderBase]: For 205/322 co-relation queries the response was YES. [2025-01-09 21:38:09,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 981 events. 165/981 cut-off events. For 205/322 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7093 event pairs, 88 based on Foata normal form. 3/871 useless extension candidates. Maximal degree in co-relation 1267. Up to 269 conditions per place. [2025-01-09 21:38:09,141 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 19 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2025-01-09 21:38:09,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 346 flow [2025-01-09 21:38:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-01-09 21:38:09,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2025-01-09 21:38:09,142 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 262 flow. Second operand 3 states and 291 transitions. [2025-01-09 21:38:09,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 346 flow [2025-01-09 21:38:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 336 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:09,144 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 308 flow [2025-01-09 21:38:09,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-01-09 21:38:09,145 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2025-01-09 21:38:09,145 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 308 flow [2025-01-09 21:38:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:38:09,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:09,146 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] [2025-01-09 21:38:09,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:38:09,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1030019360, now seen corresponding path program 1 times [2025-01-09 21:38:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312061868] [2025-01-09 21:38:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:09,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:38:09,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:38:09,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:09,331 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:38:09,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:09,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312061868] [2025-01-09 21:38:09,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312061868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:09,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904966789] [2025-01-09 21:38:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:09,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:09,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:09,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:09,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:09,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-01-09 21:38:09,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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:38:09,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:09,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-01-09 21:38:09,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:09,555 INFO L124 PetriNetUnfolderBase]: 356/1815 cut-off events. [2025-01-09 21:38:09,555 INFO L125 PetriNetUnfolderBase]: For 304/350 co-relation queries the response was YES. [2025-01-09 21:38:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1815 events. 356/1815 cut-off events. For 304/350 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15310 event pairs, 177 based on Foata normal form. 3/1659 useless extension candidates. Maximal degree in co-relation 2422. Up to 360 conditions per place. [2025-01-09 21:38:09,565 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 34 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-01-09 21:38:09,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 416 flow [2025-01-09 21:38:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2025-01-09 21:38:09,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-01-09 21:38:09,567 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 308 flow. Second operand 6 states and 520 transitions. [2025-01-09 21:38:09,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 416 flow [2025-01-09 21:38:09,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:09,570 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 302 flow [2025-01-09 21:38:09,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-01-09 21:38:09,571 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2025-01-09 21:38:09,571 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 302 flow [2025-01-09 21:38:09,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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:38:09,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:09,571 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] [2025-01-09 21:38:09,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:38:09,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1113334405, now seen corresponding path program 1 times [2025-01-09 21:38:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451563552] [2025-01-09 21:38:09,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:09,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:38:09,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:38:09,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:09,653 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:38:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451563552] [2025-01-09 21:38:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451563552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:38:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285846969] [2025-01-09 21:38:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:09,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:09,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:09,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2025-01-09 21:38:09,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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:38:09,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:09,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2025-01-09 21:38:09,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:09,824 INFO L124 PetriNetUnfolderBase]: 141/992 cut-off events. [2025-01-09 21:38:09,825 INFO L125 PetriNetUnfolderBase]: For 137/165 co-relation queries the response was YES. [2025-01-09 21:38:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 992 events. 141/992 cut-off events. For 137/165 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6850 event pairs, 43 based on Foata normal form. 15/943 useless extension candidates. Maximal degree in co-relation 974. Up to 189 conditions per place. [2025-01-09 21:38:09,828 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 23 selfloop transitions, 6 changer transitions 6/123 dead transitions. [2025-01-09 21:38:09,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 402 flow [2025-01-09 21:38:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2025-01-09 21:38:09,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-01-09 21:38:09,830 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 302 flow. Second operand 6 states and 540 transitions. [2025-01-09 21:38:09,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 402 flow [2025-01-09 21:38:09,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 123 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:09,832 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 308 flow [2025-01-09 21:38:09,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-01-09 21:38:09,832 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 10 predicate places. [2025-01-09 21:38:09,832 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 308 flow [2025-01-09 21:38:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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:38:09,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:09,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:38:09,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1214681193, now seen corresponding path program 1 times [2025-01-09 21:38:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:09,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781484900] [2025-01-09 21:38:09,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:09,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:38:09,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:38:09,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:09,872 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:38:09,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:09,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781484900] [2025-01-09 21:38:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781484900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:09,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485243209] [2025-01-09 21:38:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:09,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:09,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:09,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:09,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 105 [2025-01-09 21:38:09,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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:38:09,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:09,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 105 [2025-01-09 21:38:09,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:09,943 INFO L124 PetriNetUnfolderBase]: 56/601 cut-off events. [2025-01-09 21:38:09,943 INFO L125 PetriNetUnfolderBase]: For 235/296 co-relation queries the response was YES. [2025-01-09 21:38:09,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 601 events. 56/601 cut-off events. For 235/296 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3614 event pairs, 30 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 867. Up to 119 conditions per place. [2025-01-09 21:38:09,945 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 19 selfloop transitions, 7 changer transitions 1/117 dead transitions. [2025-01-09 21:38:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 385 flow [2025-01-09 21:38:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2025-01-09 21:38:09,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-01-09 21:38:09,947 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 308 flow. Second operand 3 states and 290 transitions. [2025-01-09 21:38:09,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 385 flow [2025-01-09 21:38:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:38:09,949 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 350 flow [2025-01-09 21:38:09,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2025-01-09 21:38:09,950 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-01-09 21:38:09,950 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 350 flow [2025-01-09 21:38:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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:38:09,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:09,950 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 21:38:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:38:09,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-01-09 21:38:09,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1584436952, now seen corresponding path program 1 times [2025-01-09 21:38:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771324297] [2025-01-09 21:38:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:09,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:38:09,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:38:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:09,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:38:09,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:38:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:38:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:09,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:38:09,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:38:09,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-09 21:38:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:38:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-01-09 21:38:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:38:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:38:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:38:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:38:09,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:38:09,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:09,992 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:38:09,992 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:38:10,007 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:38:10,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 273 flow [2025-01-09 21:38:10,037 INFO L124 PetriNetUnfolderBase]: 9/324 cut-off events. [2025-01-09 21:38:10,037 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:38:10,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 324 events. 9/324 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 890 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 207. Up to 12 conditions per place. [2025-01-09 21:38:10,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 123 transitions, 273 flow [2025-01-09 21:38:10,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 123 transitions, 273 flow [2025-01-09 21:38:10,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:38:10,040 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;@1ee730a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:38:10,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 21:38:10,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:38:10,043 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 21:38:10,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:38:10,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:10,043 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:38:10,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:10,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1593619379, now seen corresponding path program 1 times [2025-01-09 21:38:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239145991] [2025-01-09 21:38:10,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:10,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:38:10,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:38:10,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:10,061 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:38:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239145991] [2025-01-09 21:38:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239145991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254952672] [2025-01-09 21:38:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:10,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:10,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:10,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 123 [2025-01-09 21:38:10,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 123 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:38:10,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:10,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 123 [2025-01-09 21:38:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:10,384 INFO L124 PetriNetUnfolderBase]: 1071/3960 cut-off events. [2025-01-09 21:38:10,384 INFO L125 PetriNetUnfolderBase]: For 378/483 co-relation queries the response was YES. [2025-01-09 21:38:10,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3960 events. 1071/3960 cut-off events. For 378/483 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35657 event pairs, 542 based on Foata normal form. 1/3520 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2025-01-09 21:38:10,410 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 23 selfloop transitions, 5 changer transitions 1/132 dead transitions. [2025-01-09 21:38:10,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 347 flow [2025-01-09 21:38:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-01-09 21:38:10,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-01-09 21:38:10,412 INFO L175 Difference]: Start difference. First operand has 126 places, 123 transitions, 273 flow. Second operand 3 states and 342 transitions. [2025-01-09 21:38:10,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 347 flow [2025-01-09 21:38:10,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:38:10,415 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 307 flow [2025-01-09 21:38:10,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2025-01-09 21:38:10,415 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2025-01-09 21:38:10,415 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 307 flow [2025-01-09 21:38:10,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:38:10,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:10,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:10,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:38:10,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -125552179, now seen corresponding path program 1 times [2025-01-09 21:38:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046699006] [2025-01-09 21:38:10,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:10,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:10,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:10,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:10,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:10,457 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:38:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:10,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046699006] [2025-01-09 21:38:10,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046699006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:10,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8308072] [2025-01-09 21:38:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:38:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:38:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:38:10,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2025-01-09 21:38:10,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:38:10,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:10,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2025-01-09 21:38:10,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:10,921 INFO L124 PetriNetUnfolderBase]: 1315/6208 cut-off events. [2025-01-09 21:38:10,921 INFO L125 PetriNetUnfolderBase]: For 412/420 co-relation queries the response was YES. [2025-01-09 21:38:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 6208 events. 1315/6208 cut-off events. For 412/420 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 63008 event pairs, 754 based on Foata normal form. 1/5481 useless extension candidates. Maximal degree in co-relation 5371. Up to 1711 conditions per place. [2025-01-09 21:38:11,029 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 24 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2025-01-09 21:38:11,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 133 transitions, 385 flow [2025-01-09 21:38:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-01-09 21:38:11,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8482384823848238 [2025-01-09 21:38:11,031 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 307 flow. Second operand 6 states and 626 transitions. [2025-01-09 21:38:11,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 133 transitions, 385 flow [2025-01-09 21:38:11,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 133 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:11,037 INFO L231 Difference]: Finished difference. Result has 136 places, 126 transitions, 319 flow [2025-01-09 21:38:11,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=136, PETRI_TRANSITIONS=126} [2025-01-09 21:38:11,037 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 10 predicate places. [2025-01-09 21:38:11,037 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 126 transitions, 319 flow [2025-01-09 21:38:11,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:38:11,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:11,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:11,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:38:11,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:11,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1444928719, now seen corresponding path program 1 times [2025-01-09 21:38:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:11,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301566394] [2025-01-09 21:38:11,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:11,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:11,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:11,173 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:38:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301566394] [2025-01-09 21:38:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301566394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531567322] [2025-01-09 21:38:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:11,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:11,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:11,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 123 [2025-01-09 21:38:11,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 126 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:38:11,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:11,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 123 [2025-01-09 21:38:11,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:11,810 INFO L124 PetriNetUnfolderBase]: 2018/6614 cut-off events. [2025-01-09 21:38:11,810 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-01-09 21:38:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10863 conditions, 6614 events. 2018/6614 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 65707 event pairs, 917 based on Foata normal form. 0/5980 useless extension candidates. Maximal degree in co-relation 4961. Up to 2175 conditions per place. [2025-01-09 21:38:11,849 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 49 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2025-01-09 21:38:11,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 473 flow [2025-01-09 21:38:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2025-01-09 21:38:11,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8211382113821138 [2025-01-09 21:38:11,850 INFO L175 Difference]: Start difference. First operand has 136 places, 126 transitions, 319 flow. Second operand 6 states and 606 transitions. [2025-01-09 21:38:11,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 473 flow [2025-01-09 21:38:11,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 461 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 21:38:11,858 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 315 flow [2025-01-09 21:38:11,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-01-09 21:38:11,859 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 7 predicate places. [2025-01-09 21:38:11,859 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 315 flow [2025-01-09 21:38:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:38:11,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:11,860 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] [2025-01-09 21:38:11,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:38:11,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:11,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1867779067, now seen corresponding path program 1 times [2025-01-09 21:38:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:11,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207927000] [2025-01-09 21:38:11,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:11,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:38:11,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:38:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:11,882 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:38:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207927000] [2025-01-09 21:38:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207927000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945869650] [2025-01-09 21:38:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:11,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-01-09 21:38:11,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:38:11,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:11,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-01-09 21:38:11,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:12,451 INFO L124 PetriNetUnfolderBase]: 1740/6509 cut-off events. [2025-01-09 21:38:12,451 INFO L125 PetriNetUnfolderBase]: For 1634/2353 co-relation queries the response was YES. [2025-01-09 21:38:12,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10834 conditions, 6509 events. 1740/6509 cut-off events. For 1634/2353 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67643 event pairs, 967 based on Foata normal form. 10/5713 useless extension candidates. Maximal degree in co-relation 9068. Up to 2240 conditions per place. [2025-01-09 21:38:12,495 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 29 selfloop transitions, 9 changer transitions 0/140 dead transitions. [2025-01-09 21:38:12,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 140 transitions, 449 flow [2025-01-09 21:38:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-01-09 21:38:12,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214092140921409 [2025-01-09 21:38:12,496 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 315 flow. Second operand 3 states and 340 transitions. [2025-01-09 21:38:12,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 140 transitions, 449 flow [2025-01-09 21:38:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 439 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:12,499 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 381 flow [2025-01-09 21:38:12,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2025-01-09 21:38:12,500 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2025-01-09 21:38:12,500 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 381 flow [2025-01-09 21:38:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:38:12,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:12,500 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] [2025-01-09 21:38:12,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:38:12,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:12,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 84944811, now seen corresponding path program 1 times [2025-01-09 21:38:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910288801] [2025-01-09 21:38:12,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:12,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:38:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:38:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:12,696 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:38:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910288801] [2025-01-09 21:38:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910288801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425681459] [2025-01-09 21:38:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:12,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:12,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:12,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:12,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 123 [2025-01-09 21:38:12,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:38:12,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:12,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 123 [2025-01-09 21:38:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:13,485 INFO L124 PetriNetUnfolderBase]: 2856/10331 cut-off events. [2025-01-09 21:38:13,485 INFO L125 PetriNetUnfolderBase]: For 1725/2289 co-relation queries the response was YES. [2025-01-09 21:38:13,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 10331 events. 2856/10331 cut-off events. For 1725/2289 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 114192 event pairs, 1400 based on Foata normal form. 17/9184 useless extension candidates. Maximal degree in co-relation 13963. Up to 2139 conditions per place. [2025-01-09 21:38:13,547 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 46 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2025-01-09 21:38:13,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 529 flow [2025-01-09 21:38:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-01-09 21:38:13,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8346883468834688 [2025-01-09 21:38:13,549 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 381 flow. Second operand 6 states and 616 transitions. [2025-01-09 21:38:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 529 flow [2025-01-09 21:38:13,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:13,557 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 371 flow [2025-01-09 21:38:13,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-01-09 21:38:13,557 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2025-01-09 21:38:13,557 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 371 flow [2025-01-09 21:38:13,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:38:13,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:13,558 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] [2025-01-09 21:38:13,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:38:13,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 492138424, now seen corresponding path program 1 times [2025-01-09 21:38:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304712103] [2025-01-09 21:38:13,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:13,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:38:13,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:38:13,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:38:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304712103] [2025-01-09 21:38:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304712103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:13,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:13,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:38:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99468643] [2025-01-09 21:38:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:13,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:13,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:13,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123 [2025-01-09 21:38:13,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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:38:13,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:13,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123 [2025-01-09 21:38:13,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:14,070 INFO L124 PetriNetUnfolderBase]: 1305/6108 cut-off events. [2025-01-09 21:38:14,071 INFO L125 PetriNetUnfolderBase]: For 975/1236 co-relation queries the response was YES. [2025-01-09 21:38:14,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10066 conditions, 6108 events. 1305/6108 cut-off events. For 975/1236 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 63047 event pairs, 532 based on Foata normal form. 65/5601 useless extension candidates. Maximal degree in co-relation 4987. Up to 1228 conditions per place. [2025-01-09 21:38:14,101 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 38 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-01-09 21:38:14,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 150 transitions, 508 flow [2025-01-09 21:38:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-01-09 21:38:14,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577235772357723 [2025-01-09 21:38:14,103 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 371 flow. Second operand 6 states and 633 transitions. [2025-01-09 21:38:14,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 150 transitions, 508 flow [2025-01-09 21:38:14,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 150 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:14,107 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 387 flow [2025-01-09 21:38:14,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-01-09 21:38:14,108 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 10 predicate places. [2025-01-09 21:38:14,108 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 387 flow [2025-01-09 21:38:14,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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:38:14,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:14,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:14,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:38:14,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1251745138, now seen corresponding path program 1 times [2025-01-09 21:38:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:14,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201766831] [2025-01-09 21:38:14,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:14,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:38:14,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:38:14,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:38:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201766831] [2025-01-09 21:38:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201766831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671812867] [2025-01-09 21:38:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:14,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:14,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:14,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:14,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-01-09 21:38:14,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:38:14,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:14,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-01-09 21:38:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:14,437 INFO L124 PetriNetUnfolderBase]: 1088/4747 cut-off events. [2025-01-09 21:38:14,437 INFO L125 PetriNetUnfolderBase]: For 2481/2723 co-relation queries the response was YES. [2025-01-09 21:38:14,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8849 conditions, 4747 events. 1088/4747 cut-off events. For 2481/2723 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49294 event pairs, 589 based on Foata normal form. 7/4392 useless extension candidates. Maximal degree in co-relation 8119. Up to 1450 conditions per place. [2025-01-09 21:38:14,461 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 31 selfloop transitions, 13 changer transitions 0/149 dead transitions. [2025-01-09 21:38:14,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 149 transitions, 548 flow [2025-01-09 21:38:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-01-09 21:38:14,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9186991869918699 [2025-01-09 21:38:14,463 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 387 flow. Second operand 3 states and 339 transitions. [2025-01-09 21:38:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 149 transitions, 548 flow [2025-01-09 21:38:14,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 540 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:38:14,466 INFO L231 Difference]: Finished difference. Result has 137 places, 142 transitions, 497 flow [2025-01-09 21:38:14,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=137, PETRI_TRANSITIONS=142} [2025-01-09 21:38:14,466 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2025-01-09 21:38:14,466 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 142 transitions, 497 flow [2025-01-09 21:38:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:38:14,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:14,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:14,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:38:14,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:14,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 577037958, now seen corresponding path program 1 times [2025-01-09 21:38:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:14,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118083443] [2025-01-09 21:38:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:14,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:38:14,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:38:14,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:38:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118083443] [2025-01-09 21:38:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118083443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:38:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020176412] [2025-01-09 21:38:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:14,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:14,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:14,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2025-01-09 21:38:14,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 142 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:38:14,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:14,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2025-01-09 21:38:14,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:14,613 INFO L124 PetriNetUnfolderBase]: 124/1629 cut-off events. [2025-01-09 21:38:14,614 INFO L125 PetriNetUnfolderBase]: For 714/831 co-relation queries the response was YES. [2025-01-09 21:38:14,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 1629 events. 124/1629 cut-off events. For 714/831 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13415 event pairs, 20 based on Foata normal form. 21/1580 useless extension candidates. Maximal degree in co-relation 1069. Up to 142 conditions per place. [2025-01-09 21:38:14,618 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 12 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2025-01-09 21:38:14,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 470 flow [2025-01-09 21:38:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-01-09 21:38:14,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943089430894309 [2025-01-09 21:38:14,620 INFO L175 Difference]: Start difference. First operand has 137 places, 142 transitions, 497 flow. Second operand 3 states and 348 transitions. [2025-01-09 21:38:14,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 470 flow [2025-01-09 21:38:14,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 456 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:14,623 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 401 flow [2025-01-09 21:38:14,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-01-09 21:38:14,623 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2025-01-09 21:38:14,623 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 401 flow [2025-01-09 21:38:14,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:38:14,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:14,623 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 21:38:14,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:38:14,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 418315940, now seen corresponding path program 1 times [2025-01-09 21:38:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:14,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388515483] [2025-01-09 21:38:14,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:38:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:38:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:38:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388515483] [2025-01-09 21:38:14,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388515483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:14,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:14,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421732139] [2025-01-09 21:38:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:14,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:14,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:14,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-01-09 21:38:14,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:38:14,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:14,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-01-09 21:38:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:14,782 INFO L124 PetriNetUnfolderBase]: 203/1827 cut-off events. [2025-01-09 21:38:14,782 INFO L125 PetriNetUnfolderBase]: For 1305/1370 co-relation queries the response was YES. [2025-01-09 21:38:14,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1827 events. 203/1827 cut-off events. For 1305/1370 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15951 event pairs, 134 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 2856. Up to 435 conditions per place. [2025-01-09 21:38:14,787 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 25 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-01-09 21:38:14,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 483 flow [2025-01-09 21:38:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-01-09 21:38:14,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8997289972899729 [2025-01-09 21:38:14,789 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 401 flow. Second operand 3 states and 332 transitions. [2025-01-09 21:38:14,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 483 flow [2025-01-09 21:38:14,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:38:14,791 INFO L231 Difference]: Finished difference. Result has 140 places, 135 transitions, 435 flow [2025-01-09 21:38:14,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=140, PETRI_TRANSITIONS=135} [2025-01-09 21:38:14,792 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2025-01-09 21:38:14,792 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 135 transitions, 435 flow [2025-01-09 21:38:14,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:38:14,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:14,792 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:38:14,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-01-09 21:38:14,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1565139323, now seen corresponding path program 1 times [2025-01-09 21:38:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256003648] [2025-01-09 21:38:14,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:14,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:14,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:38:14,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:38:14,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:14,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:38:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:38:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:38:14,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:14,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:38:14,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-01-09 21:38:14,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-01-09 21:38:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:38:14,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:14,824 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:38:14,824 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:38:14,837 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:38:14,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 322 flow [2025-01-09 21:38:14,865 INFO L124 PetriNetUnfolderBase]: 22/541 cut-off events. [2025-01-09 21:38:14,865 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:38:14,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 541 events. 22/541 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1962 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 344. Up to 32 conditions per place. [2025-01-09 21:38:14,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 141 transitions, 322 flow [2025-01-09 21:38:14,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 322 flow [2025-01-09 21:38:14,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:38:14,868 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;@1ee730a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:38:14,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:38:14,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:38:14,870 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 21:38:14,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:38:14,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:14,870 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:38:14,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1893032109, now seen corresponding path program 1 times [2025-01-09 21:38:14,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007907751] [2025-01-09 21:38:14,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:14,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:14,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:38:14,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:38:14,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:14,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:14,882 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:38:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007907751] [2025-01-09 21:38:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007907751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158713637] [2025-01-09 21:38:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:14,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-01-09 21:38:14,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:38:14,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:14,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-01-09 21:38:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:16,607 INFO L124 PetriNetUnfolderBase]: 7859/23223 cut-off events. [2025-01-09 21:38:16,607 INFO L125 PetriNetUnfolderBase]: For 2355/2706 co-relation queries the response was YES. [2025-01-09 21:38:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35573 conditions, 23223 events. 7859/23223 cut-off events. For 2355/2706 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 267744 event pairs, 4292 based on Foata normal form. 1/21006 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2025-01-09 21:38:16,754 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 30 selfloop transitions, 6 changer transitions 1/153 dead transitions. [2025-01-09 21:38:16,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 418 flow [2025-01-09 21:38:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-01-09 21:38:16,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-01-09 21:38:16,756 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 322 flow. Second operand 3 states and 389 transitions. [2025-01-09 21:38:16,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 418 flow [2025-01-09 21:38:16,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 153 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:38:16,760 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 364 flow [2025-01-09 21:38:16,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2025-01-09 21:38:16,761 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 4 predicate places. [2025-01-09 21:38:16,761 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 364 flow [2025-01-09 21:38:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:38:16,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:16,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:38:16,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -723136755, now seen corresponding path program 1 times [2025-01-09 21:38:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972930566] [2025-01-09 21:38:16,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:16,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:16,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:16,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:16,804 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:38:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972930566] [2025-01-09 21:38:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972930566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:16,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:16,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910927800] [2025-01-09 21:38:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:38:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:16,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:38:16,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:38:16,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2025-01-09 21:38:16,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:38:16,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:16,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2025-01-09 21:38:16,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:19,540 INFO L124 PetriNetUnfolderBase]: 9298/33531 cut-off events. [2025-01-09 21:38:19,540 INFO L125 PetriNetUnfolderBase]: For 2629/2717 co-relation queries the response was YES. [2025-01-09 21:38:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50460 conditions, 33531 events. 9298/33531 cut-off events. For 2629/2717 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 429064 event pairs, 7446 based on Foata normal form. 1/29634 useless extension candidates. Maximal degree in co-relation 31413. Up to 10742 conditions per place. [2025-01-09 21:38:19,773 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 28 selfloop transitions, 2 changer transitions 5/152 dead transitions. [2025-01-09 21:38:19,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 152 transitions, 450 flow [2025-01-09 21:38:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-01-09 21:38:19,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2025-01-09 21:38:19,775 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 364 flow. Second operand 6 states and 714 transitions. [2025-01-09 21:38:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 152 transitions, 450 flow [2025-01-09 21:38:19,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 152 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:19,822 INFO L231 Difference]: Finished difference. Result has 155 places, 145 transitions, 374 flow [2025-01-09 21:38:19,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=155, PETRI_TRANSITIONS=145} [2025-01-09 21:38:19,823 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2025-01-09 21:38:19,823 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 145 transitions, 374 flow [2025-01-09 21:38:19,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:38:19,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:19,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:19,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:38:19,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2042513295, now seen corresponding path program 1 times [2025-01-09 21:38:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340602488] [2025-01-09 21:38:19,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:19,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:38:19,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:38:19,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:19,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:19,983 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:38:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:19,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340602488] [2025-01-09 21:38:19,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340602488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:19,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999409733] [2025-01-09 21:38:19,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:19,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:19,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:19,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:20,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2025-01-09 21:38:20,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 145 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:38:20,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:20,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2025-01-09 21:38:20,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:23,456 INFO L124 PetriNetUnfolderBase]: 12636/34931 cut-off events. [2025-01-09 21:38:23,456 INFO L125 PetriNetUnfolderBase]: For 3233/3237 co-relation queries the response was YES. [2025-01-09 21:38:23,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57801 conditions, 34931 events. 12636/34931 cut-off events. For 3233/3237 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 423351 event pairs, 6005 based on Foata normal form. 0/31300 useless extension candidates. Maximal degree in co-relation 57464. Up to 12806 conditions per place. [2025-01-09 21:38:23,729 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 61 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-01-09 21:38:23,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 176 transitions, 568 flow [2025-01-09 21:38:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-01-09 21:38:23,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2025-01-09 21:38:23,731 INFO L175 Difference]: Start difference. First operand has 155 places, 145 transitions, 374 flow. Second operand 6 states and 702 transitions. [2025-01-09 21:38:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 176 transitions, 568 flow [2025-01-09 21:38:23,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 176 transitions, 556 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 21:38:23,758 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 370 flow [2025-01-09 21:38:23,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2025-01-09 21:38:23,759 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 7 predicate places. [2025-01-09 21:38:23,759 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 370 flow [2025-01-09 21:38:23,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:38:23,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:23,759 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] [2025-01-09 21:38:23,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:38:23,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:23,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 490756933, now seen corresponding path program 1 times [2025-01-09 21:38:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711609903] [2025-01-09 21:38:23,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:23,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:38:23,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:38:23,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:23,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:23,776 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:38:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711609903] [2025-01-09 21:38:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711609903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841160737] [2025-01-09 21:38:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:23,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:23,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:23,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-01-09 21:38:23,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:38:23,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:23,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-01-09 21:38:23,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:27,253 INFO L124 PetriNetUnfolderBase]: 13629/40864 cut-off events. [2025-01-09 21:38:27,253 INFO L125 PetriNetUnfolderBase]: For 10495/12939 co-relation queries the response was YES. [2025-01-09 21:38:27,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70264 conditions, 40864 events. 13629/40864 cut-off events. For 10495/12939 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 523307 event pairs, 7860 based on Foata normal form. 36/36095 useless extension candidates. Maximal degree in co-relation 58384. Up to 15880 conditions per place. [2025-01-09 21:38:27,516 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 39 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2025-01-09 21:38:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 165 transitions, 556 flow [2025-01-09 21:38:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-01-09 21:38:27,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-01-09 21:38:27,519 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 370 flow. Second operand 3 states and 389 transitions. [2025-01-09 21:38:27,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 165 transitions, 556 flow [2025-01-09 21:38:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 546 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:27,522 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 456 flow [2025-01-09 21:38:27,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2025-01-09 21:38:27,523 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places. [2025-01-09 21:38:27,523 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 456 flow [2025-01-09 21:38:27,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:38:27,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:27,524 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] [2025-01-09 21:38:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:38:27,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:27,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash 603721224, now seen corresponding path program 1 times [2025-01-09 21:38:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:27,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135305508] [2025-01-09 21:38:27,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:27,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:38:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:38:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:27,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:27,653 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:38:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:27,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135305508] [2025-01-09 21:38:27,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135305508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:27,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:38:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088703985] [2025-01-09 21:38:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:27,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:27,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:27,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:27,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2025-01-09 21:38:27,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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:38:27,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:27,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2025-01-09 21:38:27,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:31,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 44#L1022-3true, 145#true, 131#L1024true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 142#true]) [2025-01-09 21:38:31,648 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-01-09 21:38:31,649 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:38:31,649 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:38:31,649 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:38:31,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([618] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][182], [Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 170#true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 146#true, 140#true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 98#L1023-6true, 22#L1023-5true, 144#true]) [2025-01-09 21:38:31,741 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,741 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,741 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,741 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [113#L1023-5true, Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 170#true, 145#true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 19#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 144#true, 142#true]) [2025-01-09 21:38:31,788 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,788 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:31,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:38:31,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-01-09 21:38:32,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([618] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 170#true, 131#L1024true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 146#true, 140#true, 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 22#L1023-5true, 144#true]) [2025-01-09 21:38:32,115 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2025-01-09 21:38:32,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:32,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:32,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:32,700 INFO L124 PetriNetUnfolderBase]: 19866/57035 cut-off events. [2025-01-09 21:38:32,700 INFO L125 PetriNetUnfolderBase]: For 9377/13250 co-relation queries the response was YES. [2025-01-09 21:38:32,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99820 conditions, 57035 events. 19866/57035 cut-off events. For 9377/13250 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 746146 event pairs, 9571 based on Foata normal form. 80/49862 useless extension candidates. Maximal degree in co-relation 78994. Up to 12589 conditions per place. [2025-01-09 21:38:33,170 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 58 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2025-01-09 21:38:33,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 644 flow [2025-01-09 21:38:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2025-01-09 21:38:33,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416075650118203 [2025-01-09 21:38:33,171 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 456 flow. Second operand 6 states and 712 transitions. [2025-01-09 21:38:33,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 644 flow [2025-01-09 21:38:33,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:33,250 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 442 flow [2025-01-09 21:38:33,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2025-01-09 21:38:33,250 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places. [2025-01-09 21:38:33,250 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 442 flow [2025-01-09 21:38:33,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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:38:33,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:33,251 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] [2025-01-09 21:38:33,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:38:33,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:33,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1772806437, now seen corresponding path program 1 times [2025-01-09 21:38:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715127671] [2025-01-09 21:38:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:33,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:38:33,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:38:33,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:33,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:38:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715127671] [2025-01-09 21:38:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715127671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:33,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:33,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:38:33,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982198081] [2025-01-09 21:38:33,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:33,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:38:33,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:33,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:38:33,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:38:33,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 141 [2025-01-09 21:38:33,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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:38:33,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:33,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 141 [2025-01-09 21:38:33,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:35,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([618] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][173], [Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 146#true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 98#L1023-6true, 22#L1023-5true, 144#true]) [2025-01-09 21:38:35,669 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-01-09 21:38:35,669 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:35,669 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:35,669 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-01-09 21:38:36,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([618] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][172], [Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 131#L1024true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 57#L1023-5true, 146#true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 22#L1023-5true, 144#true]) [2025-01-09 21:38:36,166 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2025-01-09 21:38:36,166 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:36,166 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:36,166 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-01-09 21:38:36,438 INFO L124 PetriNetUnfolderBase]: 10063/35805 cut-off events. [2025-01-09 21:38:36,438 INFO L125 PetriNetUnfolderBase]: For 6134/8108 co-relation queries the response was YES. [2025-01-09 21:38:36,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60768 conditions, 35805 events. 10063/35805 cut-off events. For 6134/8108 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 466260 event pairs, 5238 based on Foata normal form. 284/31943 useless extension candidates. Maximal degree in co-relation 31242. Up to 7614 conditions per place. [2025-01-09 21:38:36,654 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 47 selfloop transitions, 6 changer transitions 0/176 dead transitions. [2025-01-09 21:38:36,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 176 transitions, 610 flow [2025-01-09 21:38:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:38:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:38:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2025-01-09 21:38:36,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8581560283687943 [2025-01-09 21:38:36,655 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 442 flow. Second operand 6 states and 726 transitions. [2025-01-09 21:38:36,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 176 transitions, 610 flow [2025-01-09 21:38:36,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 176 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:38:36,669 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 458 flow [2025-01-09 21:38:36,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-01-09 21:38:36,670 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2025-01-09 21:38:36,670 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 458 flow [2025-01-09 21:38:36,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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:38:36,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:36,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:38:36,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:36,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1986411089, now seen corresponding path program 1 times [2025-01-09 21:38:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453941584] [2025-01-09 21:38:36,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:36,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:38:36,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:38:36,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:36,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:38:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453941584] [2025-01-09 21:38:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453941584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648038123] [2025-01-09 21:38:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:36,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:36,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:36,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:36,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-01-09 21:38:36,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:38:36,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:36,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-01-09 21:38:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:40,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][156], [Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 189#true, 32#L1024true, 145#true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 142#true]) [2025-01-09 21:38:40,271 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-01-09 21:38:40,272 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:38:40,272 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-01-09 21:38:40,272 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:38:40,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][156], [189#true, Black: 155#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1024-3true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 142#true]) [2025-01-09 21:38:40,289 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-01-09 21:38:40,289 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-01-09 21:38:40,289 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:38:40,289 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:38:40,353 INFO L124 PetriNetUnfolderBase]: 11773/38290 cut-off events. [2025-01-09 21:38:40,353 INFO L125 PetriNetUnfolderBase]: For 22026/23726 co-relation queries the response was YES. [2025-01-09 21:38:40,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74357 conditions, 38290 events. 11773/38290 cut-off events. For 22026/23726 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 513606 event pairs, 6499 based on Foata normal form. 24/34728 useless extension candidates. Maximal degree in co-relation 67309. Up to 13617 conditions per place. [2025-01-09 21:38:40,593 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 43 selfloop transitions, 18 changer transitions 0/179 dead transitions. [2025-01-09 21:38:40,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 179 transitions, 703 flow [2025-01-09 21:38:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-01-09 21:38:40,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91725768321513 [2025-01-09 21:38:40,595 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 458 flow. Second operand 3 states and 388 transitions. [2025-01-09 21:38:40,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 179 transitions, 703 flow [2025-01-09 21:38:40,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 179 transitions, 695 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:38:40,612 INFO L231 Difference]: Finished difference. Result has 156 places, 168 transitions, 628 flow [2025-01-09 21:38:40,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=156, PETRI_TRANSITIONS=168} [2025-01-09 21:38:40,615 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 11 predicate places. [2025-01-09 21:38:40,615 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 168 transitions, 628 flow [2025-01-09 21:38:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:38:40,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:40,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:38:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:38:40,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1449865181, now seen corresponding path program 1 times [2025-01-09 21:38:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634232494] [2025-01-09 21:38:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:38:40,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:38:40,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:40,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:38:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634232494] [2025-01-09 21:38:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634232494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:40,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:38:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967157689] [2025-01-09 21:38:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:40,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:40,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:40,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:40,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 141 [2025-01-09 21:38:40,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 168 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:38:40,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:40,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 141 [2025-01-09 21:38:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:41,087 INFO L124 PetriNetUnfolderBase]: 660/6291 cut-off events. [2025-01-09 21:38:41,087 INFO L125 PetriNetUnfolderBase]: For 3341/3863 co-relation queries the response was YES. [2025-01-09 21:38:41,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10688 conditions, 6291 events. 660/6291 cut-off events. For 3341/3863 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 72189 event pairs, 237 based on Foata normal form. 177/6091 useless extension candidates. Maximal degree in co-relation 8380. Up to 678 conditions per place. [2025-01-09 21:38:41,117 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 16 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2025-01-09 21:38:41,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 561 flow [2025-01-09 21:38:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-01-09 21:38:41,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385342789598109 [2025-01-09 21:38:41,118 INFO L175 Difference]: Start difference. First operand has 156 places, 168 transitions, 628 flow. Second operand 3 states and 397 transitions. [2025-01-09 21:38:41,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 158 transitions, 561 flow [2025-01-09 21:38:41,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 158 transitions, 547 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:41,125 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 468 flow [2025-01-09 21:38:41,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2025-01-09 21:38:41,126 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 11 predicate places. [2025-01-09 21:38:41,127 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 468 flow [2025-01-09 21:38:41,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:38:41,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:41,127 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 21:38:41,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:38:41,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash 221352852, now seen corresponding path program 1 times [2025-01-09 21:38:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:41,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976468752] [2025-01-09 21:38:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:38:41,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:38:41,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:41,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:38:41,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:41,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976468752] [2025-01-09 21:38:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976468752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032784066] [2025-01-09 21:38:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:41,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:41,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:41,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-01-09 21:38:41,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:38:41,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:41,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-01-09 21:38:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:41,977 INFO L124 PetriNetUnfolderBase]: 1120/7887 cut-off events. [2025-01-09 21:38:41,977 INFO L125 PetriNetUnfolderBase]: For 6402/6521 co-relation queries the response was YES. [2025-01-09 21:38:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15139 conditions, 7887 events. 1120/7887 cut-off events. For 6402/6521 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 94525 event pairs, 661 based on Foata normal form. 4/7385 useless extension candidates. Maximal degree in co-relation 11930. Up to 2068 conditions per place. [2025-01-09 21:38:42,016 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 33 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-01-09 21:38:42,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 582 flow [2025-01-09 21:38:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2025-01-09 21:38:42,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2025-01-09 21:38:42,017 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 468 flow. Second operand 3 states and 378 transitions. [2025-01-09 21:38:42,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 158 transitions, 582 flow [2025-01-09 21:38:42,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:38:42,021 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 500 flow [2025-01-09 21:38:42,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-01-09 21:38:42,022 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2025-01-09 21:38:42,022 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 500 flow [2025-01-09 21:38:42,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:38:42,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:42,023 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:42,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:38:42,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:42,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1788585602, now seen corresponding path program 1 times [2025-01-09 21:38:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:42,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38884871] [2025-01-09 21:38:42,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:42,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:38:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:38:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:38:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:38:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:38:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38884871] [2025-01-09 21:38:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38884871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:38:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:38:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:38:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098071559] [2025-01-09 21:38:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:38:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:38:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:38:42,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:38:42,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:38:42,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-01-09 21:38:42,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:38:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:38:42,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-01-09 21:38:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:38:42,847 INFO L124 PetriNetUnfolderBase]: 1121/7928 cut-off events. [2025-01-09 21:38:42,847 INFO L125 PetriNetUnfolderBase]: For 8520/8672 co-relation queries the response was YES. [2025-01-09 21:38:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15851 conditions, 7928 events. 1121/7928 cut-off events. For 8520/8672 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 95327 event pairs, 707 based on Foata normal form. 4/7482 useless extension candidates. Maximal degree in co-relation 12732. Up to 2095 conditions per place. [2025-01-09 21:38:42,888 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 33 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2025-01-09 21:38:42,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 605 flow [2025-01-09 21:38:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:38:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:38:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-01-09 21:38:42,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912529550827423 [2025-01-09 21:38:42,889 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 500 flow. Second operand 3 states and 377 transitions. [2025-01-09 21:38:42,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 605 flow [2025-01-09 21:38:42,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 160 transitions, 591 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 21:38:42,897 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 528 flow [2025-01-09 21:38:42,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2025-01-09 21:38:42,897 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 16 predicate places. [2025-01-09 21:38:42,897 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 528 flow [2025-01-09 21:38:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:38:42,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:38:42,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:42,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:38:42,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:38:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:38:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1545083146, now seen corresponding path program 1 times [2025-01-09 21:38:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:38:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219603738] [2025-01-09 21:38:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:38:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:38:42,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:38:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:38:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:42,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:38:42,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:38:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:38:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:38:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:38:42,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:38:42,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:38:42,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:38:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:38:42,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:38:43,053 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-01-09 21:38:43,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:38:43,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:38:43 BasicIcfg [2025-01-09 21:38:43,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:38:43,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:38:43,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:38:43,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:38:43,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:38:06" (3/4) ... [2025-01-09 21:38:43,066 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:38:43,157 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:38:43,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:38:43,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:38:43,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:38:43,196 INFO L158 Benchmark]: Toolchain (without parser) took 37974.87ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 108.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-01-09 21:38:43,196 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:38:43,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.55ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 80.1MB in the end (delta: 28.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:38:43,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.43ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:38:43,198 INFO L158 Benchmark]: Boogie Preprocessor took 23.32ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 77.3MB in the end (delta: 944.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:38:43,198 INFO L158 Benchmark]: RCFGBuilder took 329.81ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 62.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:38:43,199 INFO L158 Benchmark]: TraceAbstraction took 36974.93ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 61.5MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-01-09 21:38:43,200 INFO L158 Benchmark]: Witness Printer took 131.02ms. Allocated memory is still 11.7GB. Free memory was 8.5GB in the beginning and 8.4GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:38:43,201 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.55ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 80.1MB in the end (delta: 28.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.43ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.32ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 77.3MB in the end (delta: 944.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 329.81ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 62.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36974.93ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 61.5MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 131.02ms. Allocated memory is still 11.7GB. Free memory was 8.5GB in the beginning and 8.4GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=2] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1025] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1034] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1035] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1034] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 5 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 120 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 684 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 79 mSDtfsCounter, 684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 137 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 906 IncrementalHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 26 mSDtfsCounter, 906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 154 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 151 mSDtfsCounter, 1119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=628occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:38:43,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)