./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12_variant.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 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:16:50,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:16:50,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:16:50,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:16:50,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:16:50,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:16:50,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:16:50,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:16:50,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:16:50,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:16:50,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:16:50,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:16:50,189 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:16:50,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:16:50,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:50,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:50,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:50,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:16:50,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:16:50,191 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 -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-01-09 21:16:50,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:16:50,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:16:50,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:16:50,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:16:50,417 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:16:50,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-01-09 21:16:51,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ac0edf9b/557ee7351e0845db8c54e5273a4e384d/FLAG41d3bee76 [2025-01-09 21:16:51,962 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:16:51,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-01-09 21:16:51,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ac0edf9b/557ee7351e0845db8c54e5273a4e384d/FLAG41d3bee76 [2025-01-09 21:16:52,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ac0edf9b/557ee7351e0845db8c54e5273a4e384d [2025-01-09 21:16:52,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:16:52,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:16:52,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:52,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:16:52,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:16:52,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ce748c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52, skipping insertion in model container [2025-01-09 21:16:52,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:16:52,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:52,449 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:16:52,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:52,570 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:16:52,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52 WrapperNode [2025-01-09 21:16:52,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:52,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:52,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:16:52,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:16:52,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,618 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-01-09 21:16:52,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:16:52,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:16:52,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:16:52,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:16:52,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:16:52,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:16:52,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:16:52,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:16:52,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (1/1) ... [2025-01-09 21:16:52,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:52,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:16:52,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:16:52,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:16:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-09 21:16:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:16:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:16:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:16:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:16:52,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:16:52,740 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:16:52,847 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:16:52,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:16:53,048 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:16:53,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:16:53,068 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:16:53,068 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:16:53,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:53 BoogieIcfgContainer [2025-01-09 21:16:53,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:16:53,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:16:53,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:16:53,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:16:53,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:16:52" (1/3) ... [2025-01-09 21:16:53,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d877fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:53, skipping insertion in model container [2025-01-09 21:16:53,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:52" (2/3) ... [2025-01-09 21:16:53,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d877fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:16:53, skipping insertion in model container [2025-01-09 21:16:53,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:16:53" (3/3) ... [2025-01-09 21:16:53,085 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-01-09 21:16:53,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:16:53,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 157 locations, 1 initial locations, 2 loop locations, and 17 error locations. [2025-01-09 21:16:53,100 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:16:53,181 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:53,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 163 transitions, 330 flow [2025-01-09 21:16:53,295 INFO L124 PetriNetUnfolderBase]: 6/172 cut-off events. [2025-01-09 21:16:53,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 172 events. 6/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2025-01-09 21:16:53,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 163 transitions, 330 flow [2025-01-09 21:16:53,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 163 transitions, 330 flow [2025-01-09 21:16:53,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:53,357 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;@23255022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:53,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:16:53,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:53,365 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:16:53,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:53,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,365 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] [2025-01-09 21:16:53,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1645867462, now seen corresponding path program 1 times [2025-01-09 21:16:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495892445] [2025-01-09 21:16:53,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:16:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:16:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495892445] [2025-01-09 21:16:53,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495892445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186221795] [2025-01-09 21:16:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 163 [2025-01-09 21:16:53,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 163 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 163 [2025-01-09 21:16:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,584 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2025-01-09 21:16:53,584 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:53,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 154 events. 3/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 11/144 useless extension candidates. Maximal degree in co-relation 91. Up to 11 conditions per place. [2025-01-09 21:16:53,586 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/151 dead transitions. [2025-01-09 21:16:53,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 330 flow [2025-01-09 21:16:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2025-01-09 21:16:53,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918200408997955 [2025-01-09 21:16:53,600 INFO L175 Difference]: Start difference. First operand has 160 places, 163 transitions, 330 flow. Second operand 3 states and 449 transitions. [2025-01-09 21:16:53,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 330 flow [2025-01-09 21:16:53,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:53,606 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 308 flow [2025-01-09 21:16:53,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2025-01-09 21:16:53,610 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -7 predicate places. [2025-01-09 21:16:53,610 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 308 flow [2025-01-09 21:16:53,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,611 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] [2025-01-09 21:16:53,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:16:53,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1154893733, now seen corresponding path program 1 times [2025-01-09 21:16:53,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641970040] [2025-01-09 21:16:53,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:16:53,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:16:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641970040] [2025-01-09 21:16:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641970040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190250512] [2025-01-09 21:16:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 163 [2025-01-09 21:16:53,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 163 [2025-01-09 21:16:53,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,754 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2025-01-09 21:16:53,754 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 152 events. 3/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 139. Up to 11 conditions per place. [2025-01-09 21:16:53,755 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 10 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-01-09 21:16:53,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 330 flow [2025-01-09 21:16:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-01-09 21:16:53,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100204498977505 [2025-01-09 21:16:53,757 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 308 flow. Second operand 3 states and 445 transitions. [2025-01-09 21:16:53,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 330 flow [2025-01-09 21:16:53,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,760 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 306 flow [2025-01-09 21:16:53,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2025-01-09 21:16:53,761 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -9 predicate places. [2025-01-09 21:16:53,761 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 306 flow [2025-01-09 21:16:53,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,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:16:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:16:53,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -603379599, now seen corresponding path program 1 times [2025-01-09 21:16:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884602756] [2025-01-09 21:16:53,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:16:53,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:16:53,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884602756] [2025-01-09 21:16:53,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884602756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434927408] [2025-01-09 21:16:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 163 [2025-01-09 21:16:53,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 163 [2025-01-09 21:16:53,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,836 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2025-01-09 21:16:53,836 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:53,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 148 events. 3/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 127. Up to 11 conditions per place. [2025-01-09 21:16:53,837 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 11 selfloop transitions, 1 changer transitions 0/145 dead transitions. [2025-01-09 21:16:53,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 322 flow [2025-01-09 21:16:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-01-09 21:16:53,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9038854805725971 [2025-01-09 21:16:53,839 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 306 flow. Second operand 3 states and 442 transitions. [2025-01-09 21:16:53,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 322 flow [2025-01-09 21:16:53,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:53,841 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 296 flow [2025-01-09 21:16:53,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-01-09 21:16:53,842 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -13 predicate places. [2025-01-09 21:16:53,842 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 296 flow [2025-01-09 21:16:53,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,843 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] [2025-01-09 21:16:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:16:53,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1075802466, now seen corresponding path program 1 times [2025-01-09 21:16:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034393668] [2025-01-09 21:16:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:16:53,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:16:53,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034393668] [2025-01-09 21:16:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034393668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137926171] [2025-01-09 21:16:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:53,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:53,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:53,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 163 [2025-01-09 21:16:53,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:53,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 163 [2025-01-09 21:16:53,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:53,940 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2025-01-09 21:16:53,941 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:53,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 147 events. 3/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 124. Up to 10 conditions per place. [2025-01-09 21:16:53,941 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 9 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-01-09 21:16:53,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 316 flow [2025-01-09 21:16:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2025-01-09 21:16:53,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9141104294478528 [2025-01-09 21:16:53,943 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 296 flow. Second operand 3 states and 447 transitions. [2025-01-09 21:16:53,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 316 flow [2025-01-09 21:16:53,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:53,945 INFO L231 Difference]: Finished difference. Result has 147 places, 144 transitions, 297 flow [2025-01-09 21:16:53,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2025-01-09 21:16:53,946 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -13 predicate places. [2025-01-09 21:16:53,946 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 297 flow [2025-01-09 21:16:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:53,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:53,947 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:53,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:16:53,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:53,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1478368743, now seen corresponding path program 1 times [2025-01-09 21:16:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459638095] [2025-01-09 21:16:53,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:53,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:16:53,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:16:53,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:53,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459638095] [2025-01-09 21:16:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459638095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:16:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628863826] [2025-01-09 21:16:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:16:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:16:54,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:16:54,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 163 [2025-01-09 21:16:54,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 163 [2025-01-09 21:16:54,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,129 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2025-01-09 21:16:54,130 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:16:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 150 events. 2/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 136. Up to 15 conditions per place. [2025-01-09 21:16:54,130 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 14 selfloop transitions, 0 changer transitions 4/147 dead transitions. [2025-01-09 21:16:54,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 339 flow [2025-01-09 21:16:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:16:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:16:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2025-01-09 21:16:54,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8883435582822086 [2025-01-09 21:16:54,133 INFO L175 Difference]: Start difference. First operand has 147 places, 144 transitions, 297 flow. Second operand 5 states and 724 transitions. [2025-01-09 21:16:54,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 339 flow [2025-01-09 21:16:54,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:54,135 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 297 flow [2025-01-09 21:16:54,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2025-01-09 21:16:54,136 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -8 predicate places. [2025-01-09 21:16:54,136 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 297 flow [2025-01-09 21:16:54,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:54,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:16:54,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:16:54,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1406433810, now seen corresponding path program 1 times [2025-01-09 21:16:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586730717] [2025-01-09 21:16:54,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:16:54,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:16:54,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:54,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:54,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:16:54,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:16:54,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:54,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:54,194 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:54,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-01-09 21:16:54,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-01-09 21:16:54,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-01-09 21:16:54,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-01-09 21:16:54,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-01-09 21:16:54,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-01-09 21:16:54,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-01-09 21:16:54,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-01-09 21:16:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:16:54,200 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:16:54,202 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:54,202 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:16:54,256 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 248 transitions, 506 flow [2025-01-09 21:16:54,279 INFO L124 PetriNetUnfolderBase]: 10/268 cut-off events. [2025-01-09 21:16:54,280 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:16:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 268 events. 10/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 502 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 179. Up to 3 conditions per place. [2025-01-09 21:16:54,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 248 transitions, 506 flow [2025-01-09 21:16:54,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 248 transitions, 506 flow [2025-01-09 21:16:54,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:54,285 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;@23255022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:54,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 21:16:54,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:54,287 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:16:54,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:54,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,287 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] [2025-01-09 21:16:54,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:54,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 756973246, now seen corresponding path program 1 times [2025-01-09 21:16:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951766887] [2025-01-09 21:16:54,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:16:54,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:16:54,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951766887] [2025-01-09 21:16:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951766887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10862442] [2025-01-09 21:16:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 248 [2025-01-09 21:16:54,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 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:16:54,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 248 [2025-01-09 21:16:54,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,442 INFO L124 PetriNetUnfolderBase]: 61/807 cut-off events. [2025-01-09 21:16:54,443 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:16:54,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 807 events. 61/807 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4541 event pairs, 42 based on Foata normal form. 76/750 useless extension candidates. Maximal degree in co-relation 735. Up to 102 conditions per place. [2025-01-09 21:16:54,449 INFO L140 encePairwiseOnDemand]: 239/248 looper letters, 17 selfloop transitions, 2 changer transitions 1/232 dead transitions. [2025-01-09 21:16:54,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 512 flow [2025-01-09 21:16:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-01-09 21:16:54,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918010752688172 [2025-01-09 21:16:54,452 INFO L175 Difference]: Start difference. First operand has 243 places, 248 transitions, 506 flow. Second operand 3 states and 683 transitions. [2025-01-09 21:16:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 512 flow [2025-01-09 21:16:54,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 232 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:54,455 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 476 flow [2025-01-09 21:16:54,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2025-01-09 21:16:54,456 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2025-01-09 21:16:54,456 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 476 flow [2025-01-09 21:16:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 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:16:54,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,457 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] [2025-01-09 21:16:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:16:54,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2007615579, now seen corresponding path program 1 times [2025-01-09 21:16:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817175642] [2025-01-09 21:16:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:16:54,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:16:54,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817175642] [2025-01-09 21:16:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817175642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825163639] [2025-01-09 21:16:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 248 [2025-01-09 21:16:54,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 248 [2025-01-09 21:16:54,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,561 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2025-01-09 21:16:54,562 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:16:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 550 events. 25/550 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2455 event pairs, 12 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 577. Up to 39 conditions per place. [2025-01-09 21:16:54,566 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 14 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-01-09 21:16:54,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 230 transitions, 506 flow [2025-01-09 21:16:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-01-09 21:16:54,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918010752688172 [2025-01-09 21:16:54,596 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 476 flow. Second operand 3 states and 683 transitions. [2025-01-09 21:16:54,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 230 transitions, 506 flow [2025-01-09 21:16:54,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 230 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:54,599 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 474 flow [2025-01-09 21:16:54,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2025-01-09 21:16:54,600 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-01-09 21:16:54,600 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 474 flow [2025-01-09 21:16:54,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,601 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:16:54,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:16:54,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2122684017, now seen corresponding path program 1 times [2025-01-09 21:16:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160605032] [2025-01-09 21:16:54,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:16:54,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:16:54,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160605032] [2025-01-09 21:16:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160605032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83079953] [2025-01-09 21:16:54,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 248 [2025-01-09 21:16:54,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 248 [2025-01-09 21:16:54,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,720 INFO L124 PetriNetUnfolderBase]: 39/747 cut-off events. [2025-01-09 21:16:54,721 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 21:16:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 747 events. 39/747 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4135 event pairs, 20 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 786. Up to 56 conditions per place. [2025-01-09 21:16:54,726 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 16 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-01-09 21:16:54,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 498 flow [2025-01-09 21:16:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-01-09 21:16:54,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9086021505376344 [2025-01-09 21:16:54,728 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 474 flow. Second operand 3 states and 676 transitions. [2025-01-09 21:16:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 498 flow [2025-01-09 21:16:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:54,732 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 462 flow [2025-01-09 21:16:54,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2025-01-09 21:16:54,733 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2025-01-09 21:16:54,733 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 462 flow [2025-01-09 21:16:54,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,733 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] [2025-01-09 21:16:54,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:16:54,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -386337634, now seen corresponding path program 1 times [2025-01-09 21:16:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360788448] [2025-01-09 21:16:54,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:16:54,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:16:54,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360788448] [2025-01-09 21:16:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360788448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222600789] [2025-01-09 21:16:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 248 [2025-01-09 21:16:54,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 248 [2025-01-09 21:16:54,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:54,881 INFO L124 PetriNetUnfolderBase]: 47/706 cut-off events. [2025-01-09 21:16:54,882 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:16:54,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 706 events. 47/706 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3553 event pairs, 30 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 767. Up to 76 conditions per place. [2025-01-09 21:16:54,887 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-01-09 21:16:54,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 494 flow [2025-01-09 21:16:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2025-01-09 21:16:54,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9153225806451613 [2025-01-09 21:16:54,890 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 462 flow. Second operand 3 states and 681 transitions. [2025-01-09 21:16:54,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 494 flow [2025-01-09 21:16:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:54,893 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 463 flow [2025-01-09 21:16:54,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-01-09 21:16:54,894 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2025-01-09 21:16:54,894 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 463 flow [2025-01-09 21:16:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:54,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:54,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:16:54,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:54,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -757094136, now seen corresponding path program 1 times [2025-01-09 21:16:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178799080] [2025-01-09 21:16:54,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:54,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:16:54,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:16:54,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:54,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178799080] [2025-01-09 21:16:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178799080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272056469] [2025-01-09 21:16:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:54,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:54,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:54,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 248 [2025-01-09 21:16:54,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:54,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:54,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 248 [2025-01-09 21:16:54,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:55,194 INFO L124 PetriNetUnfolderBase]: 164/2093 cut-off events. [2025-01-09 21:16:55,194 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:16:55,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 2093 events. 164/2093 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17282 event pairs, 57 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2381. Up to 204 conditions per place. [2025-01-09 21:16:55,202 INFO L140 encePairwiseOnDemand]: 228/248 looper letters, 32 selfloop transitions, 14 changer transitions 0/243 dead transitions. [2025-01-09 21:16:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 243 transitions, 598 flow [2025-01-09 21:16:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-01-09 21:16:55,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.928763440860215 [2025-01-09 21:16:55,204 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 463 flow. Second operand 3 states and 691 transitions. [2025-01-09 21:16:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 243 transitions, 598 flow [2025-01-09 21:16:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 243 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:55,207 INFO L231 Difference]: Finished difference. Result has 229 places, 238 transitions, 583 flow [2025-01-09 21:16:55,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=229, PETRI_TRANSITIONS=238} [2025-01-09 21:16:55,208 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -14 predicate places. [2025-01-09 21:16:55,208 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 238 transitions, 583 flow [2025-01-09 21:16:55,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:55,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:55,209 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:16:55,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1035998380, now seen corresponding path program 1 times [2025-01-09 21:16:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65601645] [2025-01-09 21:16:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:55,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:16:55,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:16:55,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65601645] [2025-01-09 21:16:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65601645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:16:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414791562] [2025-01-09 21:16:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:16:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:55,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:16:55,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:16:55,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 248 [2025-01-09 21:16:55,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 238 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:55,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:55,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 248 [2025-01-09 21:16:55,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:55,439 INFO L124 PetriNetUnfolderBase]: 99/1990 cut-off events. [2025-01-09 21:16:55,439 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:16:55,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1990 events. 99/1990 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 16358 event pairs, 41 based on Foata normal form. 1/1702 useless extension candidates. Maximal degree in co-relation 2220. Up to 120 conditions per place. [2025-01-09 21:16:55,450 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 17 selfloop transitions, 0 changer transitions 4/241 dead transitions. [2025-01-09 21:16:55,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 241 transitions, 631 flow [2025-01-09 21:16:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:16:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:16:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1122 transitions. [2025-01-09 21:16:55,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048387096774193 [2025-01-09 21:16:55,453 INFO L175 Difference]: Start difference. First operand has 229 places, 238 transitions, 583 flow. Second operand 5 states and 1122 transitions. [2025-01-09 21:16:55,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 241 transitions, 631 flow [2025-01-09 21:16:55,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 241 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:55,457 INFO L231 Difference]: Finished difference. Result has 234 places, 237 transitions, 559 flow [2025-01-09 21:16:55,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=234, PETRI_TRANSITIONS=237} [2025-01-09 21:16:55,458 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2025-01-09 21:16:55,458 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 237 transitions, 559 flow [2025-01-09 21:16:55,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:55,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:55,459 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:55,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:16:55,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:16:55,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -685110129, now seen corresponding path program 1 times [2025-01-09 21:16:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:55,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619443214] [2025-01-09 21:16:55,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:55,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:16:55,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:16:55,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:55,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:16:55,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:16:55,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:16:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:16:55,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:16:55,484 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:16:55,484 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-01-09 21:16:55,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-01-09 21:16:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-01-09 21:16:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:16:55,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:55,487 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:16:55,487 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:16:55,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:16:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 333 transitions, 684 flow [2025-01-09 21:16:55,567 INFO L124 PetriNetUnfolderBase]: 14/364 cut-off events. [2025-01-09 21:16:55,567 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:16:55,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 364 events. 14/364 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1028 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 272. Up to 4 conditions per place. [2025-01-09 21:16:55,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 333 transitions, 684 flow [2025-01-09 21:16:55,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 333 transitions, 684 flow [2025-01-09 21:16:55,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:16:55,572 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;@23255022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:16:55,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:16:55,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:16:55,573 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:16:55,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:16:55,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:55,574 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] [2025-01-09 21:16:55,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:16:55,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:55,574 INFO L85 PathProgramCache]: Analyzing trace with hash 671796363, now seen corresponding path program 1 times [2025-01-09 21:16:55,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:55,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960052906] [2025-01-09 21:16:55,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:55,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:55,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:16:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:16:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960052906] [2025-01-09 21:16:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960052906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224022803] [2025-01-09 21:16:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:55,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:55,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:55,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:55,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 333 [2025-01-09 21:16:55,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 333 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:55,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:55,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 333 [2025-01-09 21:16:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:56,185 INFO L124 PetriNetUnfolderBase]: 763/5681 cut-off events. [2025-01-09 21:16:56,186 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-01-09 21:16:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 5681 events. 763/5681 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 60129 event pairs, 630 based on Foata normal form. 539/5289 useless extension candidates. Maximal degree in co-relation 5717. Up to 1033 conditions per place. [2025-01-09 21:16:56,239 INFO L140 encePairwiseOnDemand]: 322/333 looper letters, 24 selfloop transitions, 2 changer transitions 1/313 dead transitions. [2025-01-09 21:16:56,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 696 flow [2025-01-09 21:16:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-01-09 21:16:56,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9179179179179179 [2025-01-09 21:16:56,242 INFO L175 Difference]: Start difference. First operand has 326 places, 333 transitions, 684 flow. Second operand 3 states and 917 transitions. [2025-01-09 21:16:56,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 696 flow [2025-01-09 21:16:56,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 313 transitions, 694 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:16:56,248 INFO L231 Difference]: Finished difference. Result has 315 places, 312 transitions, 644 flow [2025-01-09 21:16:56,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=315, PETRI_TRANSITIONS=312} [2025-01-09 21:16:56,249 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -11 predicate places. [2025-01-09 21:16:56,250 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 312 transitions, 644 flow [2025-01-09 21:16:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:56,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:56,250 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] [2025-01-09 21:16:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:16:56,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:16:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1335619163, now seen corresponding path program 1 times [2025-01-09 21:16:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924332491] [2025-01-09 21:16:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:16:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:16:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924332491] [2025-01-09 21:16:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924332491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669039817] [2025-01-09 21:16:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:56,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:56,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:56,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 333 [2025-01-09 21:16:56,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 312 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:56,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:56,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 333 [2025-01-09 21:16:56,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:56,562 INFO L124 PetriNetUnfolderBase]: 163/2232 cut-off events. [2025-01-09 21:16:56,563 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-09 21:16:56,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 2232 events. 163/2232 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18986 event pairs, 108 based on Foata normal form. 0/1849 useless extension candidates. Maximal degree in co-relation 2467. Up to 199 conditions per place. [2025-01-09 21:16:56,590 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 18 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-01-09 21:16:56,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 682 flow [2025-01-09 21:16:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-01-09 21:16:56,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-01-09 21:16:56,593 INFO L175 Difference]: Start difference. First operand has 315 places, 312 transitions, 644 flow. Second operand 3 states and 921 transitions. [2025-01-09 21:16:56,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 682 flow [2025-01-09 21:16:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:56,597 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 642 flow [2025-01-09 21:16:56,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2025-01-09 21:16:56,598 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -13 predicate places. [2025-01-09 21:16:56,598 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 642 flow [2025-01-09 21:16:56,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:56,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:56,599 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:16:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:16:56,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:16:56,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash -659366991, now seen corresponding path program 1 times [2025-01-09 21:16:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580531875] [2025-01-09 21:16:56,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:16:56,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:16:56,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:56,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:56,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580531875] [2025-01-09 21:16:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580531875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:56,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:56,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039043430] [2025-01-09 21:16:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:56,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:56,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:56,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:56,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 333 [2025-01-09 21:16:56,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:56,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:56,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 333 [2025-01-09 21:16:56,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:57,053 INFO L124 PetriNetUnfolderBase]: 325/3996 cut-off events. [2025-01-09 21:16:57,053 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-09 21:16:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3996 events. 325/3996 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 40807 event pairs, 220 based on Foata normal form. 0/3339 useless extension candidates. Maximal degree in co-relation 4435. Up to 381 conditions per place. [2025-01-09 21:16:57,076 INFO L140 encePairwiseOnDemand]: 326/333 looper letters, 21 selfloop transitions, 1 changer transitions 0/305 dead transitions. [2025-01-09 21:16:57,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 674 flow [2025-01-09 21:16:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-01-09 21:16:57,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9109109109109109 [2025-01-09 21:16:57,078 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 642 flow. Second operand 3 states and 910 transitions. [2025-01-09 21:16:57,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 674 flow [2025-01-09 21:16:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 305 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:16:57,082 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 628 flow [2025-01-09 21:16:57,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2025-01-09 21:16:57,083 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -19 predicate places. [2025-01-09 21:16:57,083 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 628 flow [2025-01-09 21:16:57,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:57,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:57,084 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] [2025-01-09 21:16:57,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:16:57,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:16:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 574072542, now seen corresponding path program 1 times [2025-01-09 21:16:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137650334] [2025-01-09 21:16:57,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:57,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:16:57,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:16:57,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:57,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137650334] [2025-01-09 21:16:57,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137650334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:57,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:57,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129490683] [2025-01-09 21:16:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:57,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:57,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:57,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:57,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 333 [2025-01-09 21:16:57,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:57,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:57,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 333 [2025-01-09 21:16:57,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:16:57,491 INFO L124 PetriNetUnfolderBase]: 493/4259 cut-off events. [2025-01-09 21:16:57,492 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:16:57,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 4259 events. 493/4259 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 40967 event pairs, 390 based on Foata normal form. 0/3568 useless extension candidates. Maximal degree in co-relation 5004. Up to 652 conditions per place. [2025-01-09 21:16:57,528 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 21 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-01-09 21:16:57,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 304 transitions, 672 flow [2025-01-09 21:16:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:16:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:16:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-01-09 21:16:57,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159159159159159 [2025-01-09 21:16:57,531 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 628 flow. Second operand 3 states and 915 transitions. [2025-01-09 21:16:57,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 304 transitions, 672 flow [2025-01-09 21:16:57,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:16:57,535 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 629 flow [2025-01-09 21:16:57,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-01-09 21:16:57,535 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -19 predicate places. [2025-01-09 21:16:57,535 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 629 flow [2025-01-09 21:16:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:57,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:16:57,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:16:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:16:57,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:16:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:16:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash -37959539, now seen corresponding path program 1 times [2025-01-09 21:16:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:16:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545936220] [2025-01-09 21:16:57,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:16:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:16:57,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:16:57,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:16:57,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:16:57,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:16:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:16:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:16:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545936220] [2025-01-09 21:16:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545936220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:16:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:16:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:16:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116058335] [2025-01-09 21:16:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:16:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:16:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:16:57,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:16:57,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:16:57,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 333 [2025-01-09 21:16:57,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:16:57,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:16:57,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 333 [2025-01-09 21:16:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:00,113 INFO L124 PetriNetUnfolderBase]: 4201/31328 cut-off events. [2025-01-09 21:17:00,113 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-09 21:17:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37787 conditions, 31328 events. 4201/31328 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 462422 event pairs, 1667 based on Foata normal form. 0/26528 useless extension candidates. Maximal degree in co-relation 37744. Up to 4132 conditions per place. [2025-01-09 21:17:00,341 INFO L140 encePairwiseOnDemand]: 303/333 looper letters, 48 selfloop transitions, 21 changer transitions 0/333 dead transitions. [2025-01-09 21:17:00,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 333 transitions, 835 flow [2025-01-09 21:17:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:17:00,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924924924924925 [2025-01-09 21:17:00,344 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 629 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:17:00,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 333 transitions, 835 flow [2025-01-09 21:17:00,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 333 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:00,348 INFO L231 Difference]: Finished difference. Result has 309 places, 325 transitions, 811 flow [2025-01-09 21:17:00,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=309, PETRI_TRANSITIONS=325} [2025-01-09 21:17:00,349 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -17 predicate places. [2025-01-09 21:17:00,350 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 325 transitions, 811 flow [2025-01-09 21:17:00,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:00,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:00,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:00,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:17:00,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:17:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash 389731417, now seen corresponding path program 1 times [2025-01-09 21:17:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579033407] [2025-01-09 21:17:00,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:00,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:17:00,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:17:00,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579033407] [2025-01-09 21:17:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579033407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:17:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152230918] [2025-01-09 21:17:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:00,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:17:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:00,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:17:00,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:17:00,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 333 [2025-01-09 21:17:00,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 325 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:00,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:00,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 333 [2025-01-09 21:17:00,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, Black: 341#true, 269#L1045-2true, 187#L1061-3true, 325#true, 153#L1045-2true, 343#(= |#race~next~0| 0), 267#L1043true, 327#true]) [2025-01-09 21:17:01,430 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-01-09 21:17:01,430 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:17:01,430 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:17:01,430 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-01-09 21:17:01,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][153], [337#(= |#race~len~0| 0), 323#true, 269#L1045-2true, 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), Black: 343#(= |#race~next~0| 0), 187#L1061-3true, 325#true, 153#L1045-2true, 239#L1045-2true, 341#true, 327#true]) [2025-01-09 21:17:01,985 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:17:01,985 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:17:01,985 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:17:01,985 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:17:02,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, 269#L1045-2true, Black: 343#(= |#race~next~0| 0), 187#L1061-3true, 325#true, 153#L1045-2true, 267#L1043true, 341#true, 327#true]) [2025-01-09 21:17:02,056 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-01-09 21:17:02,056 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:17:02,056 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:17:02,056 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:17:02,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, Black: 343#(= |#race~next~0| 0), 269#L1045-2true, 187#L1061-3true, 325#true, 105#L1043-3true, 153#L1045-2true, 341#true, 327#true]) [2025-01-09 21:17:02,320 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2025-01-09 21:17:02,320 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:17:02,320 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:17:02,320 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:17:03,568 INFO L124 PetriNetUnfolderBase]: 3148/31373 cut-off events. [2025-01-09 21:17:03,568 INFO L125 PetriNetUnfolderBase]: For 856/864 co-relation queries the response was YES. [2025-01-09 21:17:03,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38075 conditions, 31373 events. 3148/31373 cut-off events. For 856/864 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 473908 event pairs, 1451 based on Foata normal form. 59/26880 useless extension candidates. Maximal degree in co-relation 38032. Up to 2767 conditions per place. [2025-01-09 21:17:03,826 INFO L140 encePairwiseOnDemand]: 329/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/338 dead transitions. [2025-01-09 21:17:03,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 338 transitions, 917 flow [2025-01-09 21:17:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:17:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:17:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1251 transitions. [2025-01-09 21:17:03,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391891891891891 [2025-01-09 21:17:03,829 INFO L175 Difference]: Start difference. First operand has 309 places, 325 transitions, 811 flow. Second operand 4 states and 1251 transitions. [2025-01-09 21:17:03,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 338 transitions, 917 flow [2025-01-09 21:17:03,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 338 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:03,852 INFO L231 Difference]: Finished difference. Result has 311 places, 325 transitions, 779 flow [2025-01-09 21:17:03,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=311, PETRI_TRANSITIONS=325} [2025-01-09 21:17:03,852 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -15 predicate places. [2025-01-09 21:17:03,853 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 325 transitions, 779 flow [2025-01-09 21:17:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:03,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:03,853 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:03,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:17:03,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:17:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash -22566822, now seen corresponding path program 1 times [2025-01-09 21:17:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986571131] [2025-01-09 21:17:03,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:04,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:17:04,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:17:04,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:04,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986571131] [2025-01-09 21:17:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986571131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651153328] [2025-01-09 21:17:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:04,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:04,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:04,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 333 [2025-01-09 21:17:04,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 325 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:04,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:04,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 333 [2025-01-09 21:17:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:05,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][144], [337#(= |#race~len~0| 0), 346#true, 289#L1043-6true, 323#true, Black: 341#true, 269#L1045-2true, 351#true, 187#L1061-3true, 325#true, 153#L1045-2true, 327#true, Black: 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0))]) [2025-01-09 21:17:05,137 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:17:05,138 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:17:05,138 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-01-09 21:17:05,138 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:17:05,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1129] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][115], [337#(= |#race~len~0| 0), 323#true, Black: 343#(= |#race~next~0| 0), 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 351#true, 269#L1045-2true, 187#L1061-3true, 325#true, 239#L1045-2true, 153#L1045-2true, 327#true]) [2025-01-09 21:17:05,186 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-01-09 21:17:05,187 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:17:05,187 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:17:05,187 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:17:06,215 INFO L124 PetriNetUnfolderBase]: 2233/24088 cut-off events. [2025-01-09 21:17:06,215 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:17:06,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28133 conditions, 24088 events. 2233/24088 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 354123 event pairs, 1151 based on Foata normal form. 1/20427 useless extension candidates. Maximal degree in co-relation 28088. Up to 2300 conditions per place. [2025-01-09 21:17:06,345 INFO L140 encePairwiseOnDemand]: 329/333 looper letters, 20 selfloop transitions, 0 changer transitions 4/328 dead transitions. [2025-01-09 21:17:06,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 328 transitions, 833 flow [2025-01-09 21:17:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:17:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:17:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1520 transitions. [2025-01-09 21:17:06,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9129129129129129 [2025-01-09 21:17:06,347 INFO L175 Difference]: Start difference. First operand has 311 places, 325 transitions, 779 flow. Second operand 5 states and 1520 transitions. [2025-01-09 21:17:06,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 328 transitions, 833 flow [2025-01-09 21:17:06,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 328 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:17:06,351 INFO L231 Difference]: Finished difference. Result has 315 places, 324 transitions, 777 flow [2025-01-09 21:17:06,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=315, PETRI_TRANSITIONS=324} [2025-01-09 21:17:06,352 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -11 predicate places. [2025-01-09 21:17:06,352 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 324 transitions, 777 flow [2025-01-09 21:17:06,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:06,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:06,352 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:17:06,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:17:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 337834538, now seen corresponding path program 1 times [2025-01-09 21:17:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954204020] [2025-01-09 21:17:06,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:17:06,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:17:06,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:06,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:06,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:17:06,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:17:06,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:17:06,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:06,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:06,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:17:06,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-01-09 21:17:06,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-01-09 21:17:06,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-01-09 21:17:06,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-01-09 21:17:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:17:06,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:06,388 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:17:06,388 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:17:06,430 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:17:06,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 418 transitions, 864 flow [2025-01-09 21:17:06,471 INFO L124 PetriNetUnfolderBase]: 18/460 cut-off events. [2025-01-09 21:17:06,472 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:17:06,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 460 events. 18/460 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1582 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 372. Up to 5 conditions per place. [2025-01-09 21:17:06,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 409 places, 418 transitions, 864 flow [2025-01-09 21:17:06,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 418 transitions, 864 flow [2025-01-09 21:17:06,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:06,481 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;@23255022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:06,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-09 21:17:06,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:06,482 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:17:06,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:06,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:06,482 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] [2025-01-09 21:17:06,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-01-09 21:17:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1390336813, now seen corresponding path program 1 times [2025-01-09 21:17:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475279526] [2025-01-09 21:17:06,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:06,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:17:06,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:17:06,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:06,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475279526] [2025-01-09 21:17:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475279526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941682508] [2025-01-09 21:17:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:06,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:06,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:06,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:06,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 418 [2025-01-09 21:17:06,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 418 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:06,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 418 [2025-01-09 21:17:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,993 INFO L124 PetriNetUnfolderBase]: 7737/41866 cut-off events. [2025-01-09 21:17:10,993 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-01-09 21:17:11,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53415 conditions, 41866 events. 7737/41866 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 611903 event pairs, 6804 based on Foata normal form. 4054/39389 useless extension candidates. Maximal degree in co-relation 44089. Up to 9608 conditions per place. [2025-01-09 21:17:11,568 INFO L140 encePairwiseOnDemand]: 405/418 looper letters, 31 selfloop transitions, 2 changer transitions 1/394 dead transitions. [2025-01-09 21:17:11,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 882 flow [2025-01-09 21:17:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1151 transitions. [2025-01-09 21:17:11,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178628389154705 [2025-01-09 21:17:11,570 INFO L175 Difference]: Start difference. First operand has 409 places, 418 transitions, 864 flow. Second operand 3 states and 1151 transitions. [2025-01-09 21:17:11,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 882 flow [2025-01-09 21:17:11,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 394 transitions, 876 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:11,575 INFO L231 Difference]: Finished difference. Result has 396 places, 393 transitions, 812 flow [2025-01-09 21:17:11,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=396, PETRI_TRANSITIONS=393} [2025-01-09 21:17:11,576 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -13 predicate places. [2025-01-09 21:17:11,576 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 393 transitions, 812 flow [2025-01-09 21:17:11,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:11,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:11,577 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] [2025-01-09 21:17:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:17:11,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-01-09 21:17:11,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1124084315, now seen corresponding path program 1 times [2025-01-09 21:17:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854974791] [2025-01-09 21:17:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:17:11,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:17:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:11,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854974791] [2025-01-09 21:17:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854974791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556374411] [2025-01-09 21:17:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:11,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:11,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:11,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 418 [2025-01-09 21:17:11,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 393 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:11,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:11,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 418 [2025-01-09 21:17:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:13,030 INFO L124 PetriNetUnfolderBase]: 909/9194 cut-off events. [2025-01-09 21:17:13,030 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-01-09 21:17:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 9194 events. 909/9194 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 110259 event pairs, 684 based on Foata normal form. 0/7621 useless extension candidates. Maximal degree in co-relation 10453. Up to 1031 conditions per place. [2025-01-09 21:17:13,207 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 22 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2025-01-09 21:17:13,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 392 transitions, 858 flow [2025-01-09 21:17:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2025-01-09 21:17:13,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242424242424242 [2025-01-09 21:17:13,210 INFO L175 Difference]: Start difference. First operand has 396 places, 393 transitions, 812 flow. Second operand 3 states and 1159 transitions. [2025-01-09 21:17:13,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 392 transitions, 858 flow [2025-01-09 21:17:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 392 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:13,214 INFO L231 Difference]: Finished difference. Result has 394 places, 392 transitions, 810 flow [2025-01-09 21:17:13,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=394, PETRI_TRANSITIONS=392} [2025-01-09 21:17:13,215 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -15 predicate places. [2025-01-09 21:17:13,215 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 392 transitions, 810 flow [2025-01-09 21:17:13,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:13,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:13,216 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:17:13,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:17:13,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-01-09 21:17:13,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -359598031, now seen corresponding path program 1 times [2025-01-09 21:17:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:13,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259758407] [2025-01-09 21:17:13,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:13,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:17:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:17:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:13,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259758407] [2025-01-09 21:17:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259758407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507292343] [2025-01-09 21:17:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:13,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 418 [2025-01-09 21:17:13,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 392 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:13,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:13,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 418 [2025-01-09 21:17:13,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:15,550 INFO L124 PetriNetUnfolderBase]: 2261/20895 cut-off events. [2025-01-09 21:17:15,551 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-01-09 21:17:15,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23878 conditions, 20895 events. 2261/20895 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 295755 event pairs, 1720 based on Foata normal form. 0/17497 useless extension candidates. Maximal degree in co-relation 23834. Up to 2506 conditions per place. [2025-01-09 21:17:16,046 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 26 selfloop transitions, 1 changer transitions 0/385 dead transitions. [2025-01-09 21:17:16,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 385 transitions, 850 flow [2025-01-09 21:17:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-01-09 21:17:16,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-01-09 21:17:16,048 INFO L175 Difference]: Start difference. First operand has 394 places, 392 transitions, 810 flow. Second operand 3 states and 1144 transitions. [2025-01-09 21:17:16,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 385 transitions, 850 flow [2025-01-09 21:17:16,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 385 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:16,053 INFO L231 Difference]: Finished difference. Result has 387 places, 385 transitions, 794 flow [2025-01-09 21:17:16,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=387, PETRI_TRANSITIONS=385} [2025-01-09 21:17:16,054 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -22 predicate places. [2025-01-09 21:17:16,054 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 385 transitions, 794 flow [2025-01-09 21:17:16,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:16,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:16,054 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] [2025-01-09 21:17:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:17:16,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-01-09 21:17:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1805428062, now seen corresponding path program 1 times [2025-01-09 21:17:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682442085] [2025-01-09 21:17:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:16,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:17:16,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:17:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682442085] [2025-01-09 21:17:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682442085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42431531] [2025-01-09 21:17:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:16,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:16,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:16,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 418 [2025-01-09 21:17:16,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 385 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:16,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:16,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 418 [2025-01-09 21:17:16,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:19,198 INFO L124 PetriNetUnfolderBase]: 4251/26676 cut-off events. [2025-01-09 21:17:19,198 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2025-01-09 21:17:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32649 conditions, 26676 events. 4251/26676 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 358772 event pairs, 3630 based on Foata normal form. 0/22471 useless extension candidates. Maximal degree in co-relation 32605. Up to 5188 conditions per place. [2025-01-09 21:17:19,781 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 27 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-01-09 21:17:19,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 384 transitions, 850 flow [2025-01-09 21:17:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-01-09 21:17:19,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916267942583732 [2025-01-09 21:17:19,784 INFO L175 Difference]: Start difference. First operand has 387 places, 385 transitions, 794 flow. Second operand 3 states and 1149 transitions. [2025-01-09 21:17:19,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 384 transitions, 850 flow [2025-01-09 21:17:19,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 384 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:19,790 INFO L231 Difference]: Finished difference. Result has 387 places, 384 transitions, 795 flow [2025-01-09 21:17:19,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=387, PETRI_TRANSITIONS=384} [2025-01-09 21:17:19,790 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -22 predicate places. [2025-01-09 21:17:19,791 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 384 transitions, 795 flow [2025-01-09 21:17:19,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:19,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:19,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:19,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:17:19,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-01-09 21:17:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1697100827, now seen corresponding path program 1 times [2025-01-09 21:17:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671032010] [2025-01-09 21:17:19,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:19,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:17:19,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:17:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671032010] [2025-01-09 21:17:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671032010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434731637] [2025-01-09 21:17:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:19,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:19,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:19,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 418 [2025-01-09 21:17:19,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 384 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:19,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:19,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 418 [2025-01-09 21:17:19,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand