./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.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-theta/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:40:54,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:40:54,870 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:40:54,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:40:54,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:40:54,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:40:54,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:40:54,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:40:54,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:40:54,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:40:54,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:40:54,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:40:54,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:40:54,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:40:54,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:40:54,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:54,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:54,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:40:54,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:40:54,895 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-01-09 21:40:55,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:40:55,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:40:55,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:40:55,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:40:55,101 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:40:55,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-09 21:40:56,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2292ef10/70d6b01e29bd4ad7b998ad1284b8f6b0/FLAG3bd76c64a [2025-01-09 21:40:56,665 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:40:56,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-09 21:40:56,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2292ef10/70d6b01e29bd4ad7b998ad1284b8f6b0/FLAG3bd76c64a [2025-01-09 21:40:56,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2292ef10/70d6b01e29bd4ad7b998ad1284b8f6b0 [2025-01-09 21:40:56,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:40:56,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:40:56,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:40:56,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:40:56,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:40:56,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:56" (1/1) ... [2025-01-09 21:40:56,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c13caa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:56, skipping insertion in model container [2025-01-09 21:40:56,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:56" (1/1) ... [2025-01-09 21:40:56,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:40:56,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:40:56,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:40:57,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:40:57,064 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:40:57,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57 WrapperNode [2025-01-09 21:40:57,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:40:57,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:40:57,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:40:57,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:40:57,071 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:40:57" (1/1) ... [2025-01-09 21:40:57,078 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:40:57" (1/1) ... [2025-01-09 21:40:57,093 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-01-09 21:40:57,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:40:57,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:40:57,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:40:57,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:40:57,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:40:57,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:40:57,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:40:57,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:40:57,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (1/1) ... [2025-01-09 21:40:57,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:57,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:40:57,150 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:40:57,158 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:40:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:40:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 21:40:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 21:40:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 21:40:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 21:40:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:40:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:40:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:40:57,175 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:40:57,245 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:40:57,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:40:57,332 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:40:57,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:40:57,338 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:40:57,338 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:40:57,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:57 BoogieIcfgContainer [2025-01-09 21:40:57,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:40:57,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:40:57,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:40:57,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:40:57,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:40:56" (1/3) ... [2025-01-09 21:40:57,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d96608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:57, skipping insertion in model container [2025-01-09 21:40:57,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:57" (2/3) ... [2025-01-09 21:40:57,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d96608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:57, skipping insertion in model container [2025-01-09 21:40:57,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:57" (3/3) ... [2025-01-09 21:40:57,345 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-01-09 21:40:57,353 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:40:57,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-09 21:40:57,354 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:40:57,390 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 105 transitions, 218 flow [2025-01-09 21:40:57,478 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2025-01-09 21:40:57,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:57,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 154 events. 10/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 258 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2025-01-09 21:40:57,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 105 transitions, 218 flow [2025-01-09 21:40:57,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 88 transitions, 183 flow [2025-01-09 21:40:57,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:57,506 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:57,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:40:57,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:57,514 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:57,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:57,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:57,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:57,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1407772652, now seen corresponding path program 1 times [2025-01-09 21:40:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-01-09 21:40:57,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:57,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:57,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:57,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:57,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:57,630 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:40:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-01-09 21:40:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177778690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199465872] [2025-01-09 21:40:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:57,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:57,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 105 [2025-01-09 21:40:57,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:40:57,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:57,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 105 [2025-01-09 21:40:57,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:57,705 INFO L124 PetriNetUnfolderBase]: 5/124 cut-off events. [2025-01-09 21:40:57,705 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:40:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 124 events. 5/124 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 2 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 93. Up to 20 conditions per place. [2025-01-09 21:40:57,708 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 11 selfloop transitions, 2 changer transitions 1/85 dead transitions. [2025-01-09 21:40:57,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 203 flow [2025-01-09 21:40:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2025-01-09 21:40:57,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2025-01-09 21:40:57,717 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 183 flow. Second operand 3 states and 274 transitions. [2025-01-09 21:40:57,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 203 flow [2025-01-09 21:40:57,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:57,722 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 178 flow [2025-01-09 21:40:57,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-01-09 21:40:57,725 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-01-09 21:40:57,725 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 178 flow [2025-01-09 21:40:57,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:40:57,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:57,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:40:57,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1400304461, now seen corresponding path program 1 times [2025-01-09 21:40:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166483538] [2025-01-09 21:40:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:57,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:57,801 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:40:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166483538] [2025-01-09 21:40:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166483538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443476045] [2025-01-09 21:40:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:57,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:57,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:57,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2025-01-09 21:40:57,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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:40:57,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:57,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2025-01-09 21:40:57,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:57,857 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2025-01-09 21:40:57,858 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:40:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 110 events. 3/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 116. Up to 15 conditions per place. [2025-01-09 21:40:57,858 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 9 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2025-01-09 21:40:57,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 192 flow [2025-01-09 21:40:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-01-09 21:40:57,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.834920634920635 [2025-01-09 21:40:57,860 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 178 flow. Second operand 3 states and 263 transitions. [2025-01-09 21:40:57,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 192 flow [2025-01-09 21:40:57,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:57,861 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 116 flow [2025-01-09 21:40:57,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2025-01-09 21:40:57,862 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-01-09 21:40:57,862 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 116 flow [2025-01-09 21:40:57,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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:40:57,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:57,862 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:40:57,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:57,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2064953177, now seen corresponding path program 1 times [2025-01-09 21:40:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-01-09 21:40:57,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:57,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:40:57,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:40:57,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:57,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:57,979 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:40:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-01-09 21:40:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675310598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:40:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278103995] [2025-01-09 21:40:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:57,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:40:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:57,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:40:57,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:40:58,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 105 [2025-01-09 21:40:58,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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:40:58,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 105 [2025-01-09 21:40:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,028 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-01-09 21:40:58,028 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:40:58,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 61 events. 0/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-01-09 21:40:58,029 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 5 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-01-09 21:40:58,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 130 flow [2025-01-09 21:40:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:40:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:40:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2025-01-09 21:40:58,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2025-01-09 21:40:58,034 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 116 flow. Second operand 4 states and 365 transitions. [2025-01-09 21:40:58,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 130 flow [2025-01-09 21:40:58,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:58,035 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 119 flow [2025-01-09 21:40:58,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-01-09 21:40:58,036 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -29 predicate places. [2025-01-09 21:40:58,036 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 119 flow [2025-01-09 21:40:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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:40:58,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,036 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:40:58,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash 786077928, now seen corresponding path program 1 times [2025-01-09 21:40:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585852603] [2025-01-09 21:40:58,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:40:58,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:40:58,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:40:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:40:58,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:58,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:58,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:40:58,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:40:58,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:40:58,116 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:58,121 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:58,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:40:58,150 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:58,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 302 flow [2025-01-09 21:40:58,170 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2025-01-09 21:40:58,171 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:40:58,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 217 events. 14/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 463 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 228. Up to 6 conditions per place. [2025-01-09 21:40:58,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 302 flow [2025-01-09 21:40:58,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 203 flow [2025-01-09 21:40:58,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:58,173 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:58,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:40:58,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:58,175 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:58,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:58,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash -526165172, now seen corresponding path program 1 times [2025-01-09 21:40:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-01-09 21:40:58,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:58,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:58,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,202 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:40:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-01-09 21:40:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347356590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900053477] [2025-01-09 21:40:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:58,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:58,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 141 [2025-01-09 21:40:58,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:40:58,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 141 [2025-01-09 21:40:58,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,263 INFO L124 PetriNetUnfolderBase]: 7/173 cut-off events. [2025-01-09 21:40:58,264 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:40:58,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 173 events. 7/173 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 312 event pairs, 3 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 150. Up to 27 conditions per place. [2025-01-09 21:40:58,265 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 12 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-01-09 21:40:58,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 225 flow [2025-01-09 21:40:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-01-09 21:40:58,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8628841607565012 [2025-01-09 21:40:58,266 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 203 flow. Second operand 3 states and 365 transitions. [2025-01-09 21:40:58,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 225 flow [2025-01-09 21:40:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:58,267 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 198 flow [2025-01-09 21:40:58,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-01-09 21:40:58,268 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2025-01-09 21:40:58,268 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 198 flow [2025-01-09 21:40:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:40:58,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:40:58,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1644396608, now seen corresponding path program 1 times [2025-01-09 21:40:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-01-09 21:40:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:58,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,300 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:40:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-01-09 21:40:58,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610679270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281082272] [2025-01-09 21:40:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:58,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:58,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-01-09 21:40:58,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:40:58,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-01-09 21:40:58,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,351 INFO L124 PetriNetUnfolderBase]: 4/154 cut-off events. [2025-01-09 21:40:58,354 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:40:58,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 154 events. 4/154 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 230 event pairs, 0 based on Foata normal form. 3/150 useless extension candidates. Maximal degree in co-relation 170. Up to 20 conditions per place. [2025-01-09 21:40:58,355 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 10 selfloop transitions, 1 changer transitions 24/86 dead transitions. [2025-01-09 21:40:58,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 86 transitions, 214 flow [2025-01-09 21:40:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-01-09 21:40:58,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226950354609929 [2025-01-09 21:40:58,357 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 198 flow. Second operand 3 states and 348 transitions. [2025-01-09 21:40:58,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 86 transitions, 214 flow [2025-01-09 21:40:58,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 86 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:58,374 INFO L231 Difference]: Finished difference. Result has 93 places, 62 transitions, 136 flow [2025-01-09 21:40:58,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=93, PETRI_TRANSITIONS=62} [2025-01-09 21:40:58,374 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -6 predicate places. [2025-01-09 21:40:58,374 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 62 transitions, 136 flow [2025-01-09 21:40:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:40:58,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,375 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:40:58,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:58,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -258681739, now seen corresponding path program 1 times [2025-01-09 21:40:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386553983] [2025-01-09 21:40:58,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:40:58,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:40:58,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,436 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:40:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386553983] [2025-01-09 21:40:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386553983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:40:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769802068] [2025-01-09 21:40:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:40:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:40:58,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:40:58,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 141 [2025-01-09 21:40:58,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 62 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:40:58,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2025-01-09 21:40:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,472 INFO L124 PetriNetUnfolderBase]: 0/81 cut-off events. [2025-01-09 21:40:58,473 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:40:58,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 81 events. 0/81 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 23 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-01-09 21:40:58,473 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 6 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-01-09 21:40:58,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 152 flow [2025-01-09 21:40:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:40:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:40:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2025-01-09 21:40:58,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8687943262411347 [2025-01-09 21:40:58,475 INFO L175 Difference]: Start difference. First operand has 93 places, 62 transitions, 136 flow. Second operand 4 states and 490 transitions. [2025-01-09 21:40:58,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 152 flow [2025-01-09 21:40:58,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:58,476 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 139 flow [2025-01-09 21:40:58,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-01-09 21:40:58,476 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places. [2025-01-09 21:40:58,476 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 139 flow [2025-01-09 21:40:58,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:40:58,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,477 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:40:58,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:58,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 686852977, now seen corresponding path program 1 times [2025-01-09 21:40:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798009196] [2025-01-09 21:40:58,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:40:58,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:40:58,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:58,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:40:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:40:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:58,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-01-09 21:40:58,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:40:58,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:40:58,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:40:58,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:40:58,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:58,507 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:58,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:40:58,531 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:58,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 177 transitions, 390 flow [2025-01-09 21:40:58,549 INFO L124 PetriNetUnfolderBase]: 18/280 cut-off events. [2025-01-09 21:40:58,549 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:40:58,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 280 events. 18/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 646 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 297. Up to 8 conditions per place. [2025-01-09 21:40:58,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 177 transitions, 390 flow [2025-01-09 21:40:58,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 102 transitions, 225 flow [2025-01-09 21:40:58,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:58,553 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:58,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:40:58,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:58,554 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:58,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:58,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:40:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1066946092, now seen corresponding path program 1 times [2025-01-09 21:40:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753049655] [2025-01-09 21:40:58,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:58,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:58,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,578 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:40:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753049655] [2025-01-09 21:40:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753049655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92843336] [2025-01-09 21:40:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:58,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 177 [2025-01-09 21:40:58,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:40:58,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 177 [2025-01-09 21:40:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,644 INFO L124 PetriNetUnfolderBase]: 9/222 cut-off events. [2025-01-09 21:40:58,644 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:40:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 222 events. 9/222 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 467 event pairs, 4 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 211. Up to 34 conditions per place. [2025-01-09 21:40:58,646 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 13 selfloop transitions, 2 changer transitions 1/99 dead transitions. [2025-01-09 21:40:58,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 249 flow [2025-01-09 21:40:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-01-09 21:40:58,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587570621468926 [2025-01-09 21:40:58,649 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 225 flow. Second operand 3 states and 456 transitions. [2025-01-09 21:40:58,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 249 flow [2025-01-09 21:40:58,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 99 transitions, 246 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:58,651 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 218 flow [2025-01-09 21:40:58,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-01-09 21:40:58,652 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2025-01-09 21:40:58,652 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 218 flow [2025-01-09 21:40:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:40:58,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:40:58,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:40:58,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1661349903, now seen corresponding path program 1 times [2025-01-09 21:40:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297982661] [2025-01-09 21:40:58,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:58,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:58,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,676 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:40:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297982661] [2025-01-09 21:40:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297982661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709641450] [2025-01-09 21:40:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:58,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:58,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 177 [2025-01-09 21:40:58,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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:40:58,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 177 [2025-01-09 21:40:58,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,735 INFO L124 PetriNetUnfolderBase]: 5/198 cut-off events. [2025-01-09 21:40:58,735 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:40:58,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 198 events. 5/198 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 341 event pairs, 0 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 224. Up to 25 conditions per place. [2025-01-09 21:40:58,736 INFO L140 encePairwiseOnDemand]: 171/177 looper letters, 11 selfloop transitions, 1 changer transitions 24/93 dead transitions. [2025-01-09 21:40:58,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 93 transitions, 236 flow [2025-01-09 21:40:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2025-01-09 21:40:58,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.815442561205273 [2025-01-09 21:40:58,737 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 218 flow. Second operand 3 states and 433 transitions. [2025-01-09 21:40:58,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 93 transitions, 236 flow [2025-01-09 21:40:58,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 93 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:58,739 INFO L231 Difference]: Finished difference. Result has 102 places, 69 transitions, 156 flow [2025-01-09 21:40:58,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=102, PETRI_TRANSITIONS=69} [2025-01-09 21:40:58,740 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2025-01-09 21:40:58,740 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 69 transitions, 156 flow [2025-01-09 21:40:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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:40:58,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,740 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:40:58,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:40:58,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 847456792, now seen corresponding path program 1 times [2025-01-09 21:40:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162961046] [2025-01-09 21:40:58,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:40:58,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:40:58,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,829 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:40:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162961046] [2025-01-09 21:40:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162961046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:40:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112978103] [2025-01-09 21:40:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:40:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:40:58,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:40:58,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 177 [2025-01-09 21:40:58,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 69 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 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:40:58,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:58,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 177 [2025-01-09 21:40:58,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:58,877 INFO L124 PetriNetUnfolderBase]: 0/101 cut-off events. [2025-01-09 21:40:58,877 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:40:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 101 events. 0/101 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 35 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-01-09 21:40:58,877 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 7 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-01-09 21:40:58,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 174 flow [2025-01-09 21:40:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:40:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:40:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2025-01-09 21:40:58,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8686440677966102 [2025-01-09 21:40:58,880 INFO L175 Difference]: Start difference. First operand has 102 places, 69 transitions, 156 flow. Second operand 4 states and 615 transitions. [2025-01-09 21:40:58,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 174 flow [2025-01-09 21:40:58,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:58,881 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 159 flow [2025-01-09 21:40:58,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2025-01-09 21:40:58,882 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -29 predicate places. [2025-01-09 21:40:58,882 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 159 flow [2025-01-09 21:40:58,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 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:40:58,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,883 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:40:58,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:40:58,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash -363504475, now seen corresponding path program 1 times [2025-01-09 21:40:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946732581] [2025-01-09 21:40:58,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:40:58,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:40:58,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:40:58,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:40:58,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:58,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:58,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:58,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:40:58,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:40:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:40:58,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:58,925 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:58,925 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:40:58,952 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 213 transitions, 482 flow [2025-01-09 21:40:58,972 INFO L124 PetriNetUnfolderBase]: 22/343 cut-off events. [2025-01-09 21:40:58,972 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:40:58,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 343 events. 22/343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 859 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 367. Up to 10 conditions per place. [2025-01-09 21:40:58,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 213 transitions, 482 flow [2025-01-09 21:40:58,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 249 flow [2025-01-09 21:40:58,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:58,975 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:58,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:40:58,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:58,976 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:58,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:58,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:58,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:58,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:40:58,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1892139148, now seen corresponding path program 1 times [2025-01-09 21:40:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8466592] [2025-01-09 21:40:58,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:58,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:58,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:58,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:58,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:58,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:58,988 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:40:58,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8466592] [2025-01-09 21:40:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8466592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:58,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:58,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677933474] [2025-01-09 21:40:58,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:58,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:58,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:58,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 213 [2025-01-09 21:40:59,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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:40:59,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 213 [2025-01-09 21:40:59,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,068 INFO L124 PetriNetUnfolderBase]: 11/271 cut-off events. [2025-01-09 21:40:59,069 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:40:59,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 271 events. 11/271 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 579 event pairs, 5 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 273. Up to 41 conditions per place. [2025-01-09 21:40:59,070 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 14 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2025-01-09 21:40:59,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 275 flow [2025-01-09 21:40:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2025-01-09 21:40:59,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8560250391236307 [2025-01-09 21:40:59,071 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 249 flow. Second operand 3 states and 547 transitions. [2025-01-09 21:40:59,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 275 flow [2025-01-09 21:40:59,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 268 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,073 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 238 flow [2025-01-09 21:40:59,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-01-09 21:40:59,073 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2025-01-09 21:40:59,073 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 238 flow [2025-01-09 21:40:59,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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:40:59,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:40:59,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:40:59,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1567357894, now seen corresponding path program 1 times [2025-01-09 21:40:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74643965] [2025-01-09 21:40:59,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:59,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,087 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:40:59,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74643965] [2025-01-09 21:40:59,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74643965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144676673] [2025-01-09 21:40:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 213 [2025-01-09 21:40:59,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:40:59,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 213 [2025-01-09 21:40:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,138 INFO L124 PetriNetUnfolderBase]: 6/242 cut-off events. [2025-01-09 21:40:59,138 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:40:59,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 242 events. 6/242 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 429 event pairs, 0 based on Foata normal form. 5/236 useless extension candidates. Maximal degree in co-relation 278. Up to 30 conditions per place. [2025-01-09 21:40:59,139 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 12 selfloop transitions, 1 changer transitions 24/100 dead transitions. [2025-01-09 21:40:59,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 100 transitions, 258 flow [2025-01-09 21:40:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:40:59,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.810641627543036 [2025-01-09 21:40:59,141 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 238 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:40:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 100 transitions, 258 flow [2025-01-09 21:40:59,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:59,142 INFO L231 Difference]: Finished difference. Result has 111 places, 76 transitions, 176 flow [2025-01-09 21:40:59,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=111, PETRI_TRANSITIONS=76} [2025-01-09 21:40:59,143 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -6 predicate places. [2025-01-09 21:40:59,143 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 76 transitions, 176 flow [2025-01-09 21:40:59,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:40:59,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,144 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:40:59,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:40:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1948378434, now seen corresponding path program 1 times [2025-01-09 21:40:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095288042] [2025-01-09 21:40:59,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:40:59,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:40:59,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,205 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:40:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095288042] [2025-01-09 21:40:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095288042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:40:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715875197] [2025-01-09 21:40:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:40:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:40:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:40:59,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 213 [2025-01-09 21:40:59,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 76 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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:40:59,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 213 [2025-01-09 21:40:59,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,264 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-01-09 21:40:59,264 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:40:59,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 121 events. 0/121 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 48 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-01-09 21:40:59,264 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 8 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-01-09 21:40:59,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 75 transitions, 196 flow [2025-01-09 21:40:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:40:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:40:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 740 transitions. [2025-01-09 21:40:59,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8685446009389671 [2025-01-09 21:40:59,267 INFO L175 Difference]: Start difference. First operand has 111 places, 76 transitions, 176 flow. Second operand 4 states and 740 transitions. [2025-01-09 21:40:59,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 75 transitions, 196 flow [2025-01-09 21:40:59,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 75 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,268 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 179 flow [2025-01-09 21:40:59,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-01-09 21:40:59,269 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -29 predicate places. [2025-01-09 21:40:59,269 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 179 flow [2025-01-09 21:40:59,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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:40:59,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,269 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:40:59,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:40:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1860904068, now seen corresponding path program 1 times [2025-01-09 21:40:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145264046] [2025-01-09 21:40:59,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:40:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:40:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:40:59,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:40:59,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:59,301 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:59,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:40:59,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:40:59,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:40:59,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:40:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:40:59,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:40:59,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:59,303 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:59,303 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 21:40:59,339 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:59,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 578 flow [2025-01-09 21:40:59,375 INFO L124 PetriNetUnfolderBase]: 26/406 cut-off events. [2025-01-09 21:40:59,375 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:40:59,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 406 events. 26/406 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1041 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 438. Up to 12 conditions per place. [2025-01-09 21:40:59,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 578 flow [2025-01-09 21:40:59,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 116 transitions, 275 flow [2025-01-09 21:40:59,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:59,379 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:59,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:40:59,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:59,380 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:59,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:59,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:40:59,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1949413996, now seen corresponding path program 1 times [2025-01-09 21:40:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721378656] [2025-01-09 21:40:59,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:59,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:59,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,394 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:40:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721378656] [2025-01-09 21:40:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721378656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908320506] [2025-01-09 21:40:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 249 [2025-01-09 21:40:59,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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:40:59,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 249 [2025-01-09 21:40:59,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,476 INFO L124 PetriNetUnfolderBase]: 13/320 cut-off events. [2025-01-09 21:40:59,476 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:40:59,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 320 events. 13/320 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 740 event pairs, 6 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 336. Up to 48 conditions per place. [2025-01-09 21:40:59,477 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 15 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-01-09 21:40:59,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 113 transitions, 303 flow [2025-01-09 21:40:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2025-01-09 21:40:59,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540829986613119 [2025-01-09 21:40:59,479 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 275 flow. Second operand 3 states and 638 transitions. [2025-01-09 21:40:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 113 transitions, 303 flow [2025-01-09 21:40:59,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 113 transitions, 290 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,481 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 258 flow [2025-01-09 21:40:59,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2025-01-09 21:40:59,482 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2025-01-09 21:40:59,482 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 258 flow [2025-01-09 21:40:59,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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:40:59,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:40:59,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:40:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1554381889, now seen corresponding path program 1 times [2025-01-09 21:40:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619225602] [2025-01-09 21:40:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:59,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:59,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,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:40:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619225602] [2025-01-09 21:40:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619225602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480138870] [2025-01-09 21:40:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 249 [2025-01-09 21:40:59,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:40:59,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 249 [2025-01-09 21:40:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,563 INFO L124 PetriNetUnfolderBase]: 7/286 cut-off events. [2025-01-09 21:40:59,563 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:40:59,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 286 events. 7/286 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 545 event pairs, 0 based on Foata normal form. 6/279 useless extension candidates. Maximal degree in co-relation 332. Up to 35 conditions per place. [2025-01-09 21:40:59,564 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 13 selfloop transitions, 1 changer transitions 24/107 dead transitions. [2025-01-09 21:40:59,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 280 flow [2025-01-09 21:40:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-01-09 21:40:59,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8072289156626506 [2025-01-09 21:40:59,566 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 258 flow. Second operand 3 states and 603 transitions. [2025-01-09 21:40:59,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 280 flow [2025-01-09 21:40:59,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 107 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:59,568 INFO L231 Difference]: Finished difference. Result has 120 places, 83 transitions, 196 flow [2025-01-09 21:40:59,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2025-01-09 21:40:59,569 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2025-01-09 21:40:59,569 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 196 flow [2025-01-09 21:40:59,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:40:59,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,569 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:40:59,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:40:59,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1010453235, now seen corresponding path program 1 times [2025-01-09 21:40:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170128672] [2025-01-09 21:40:59,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:40:59,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:40:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,629 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:40:59,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170128672] [2025-01-09 21:40:59,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170128672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:40:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157615193] [2025-01-09 21:40:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:40:59,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:40:59,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:40:59,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 249 [2025-01-09 21:40:59,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 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:40:59,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 249 [2025-01-09 21:40:59,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,690 INFO L124 PetriNetUnfolderBase]: 0/141 cut-off events. [2025-01-09 21:40:59,691 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:40:59,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 141 events. 0/141 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 59 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-01-09 21:40:59,691 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 9 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-01-09 21:40:59,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 82 transitions, 218 flow [2025-01-09 21:40:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:40:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:40:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 865 transitions. [2025-01-09 21:40:59,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8684738955823293 [2025-01-09 21:40:59,696 INFO L175 Difference]: Start difference. First operand has 120 places, 83 transitions, 196 flow. Second operand 4 states and 865 transitions. [2025-01-09 21:40:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 82 transitions, 218 flow [2025-01-09 21:40:59,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 82 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,698 INFO L231 Difference]: Finished difference. Result has 97 places, 82 transitions, 199 flow [2025-01-09 21:40:59,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=97, PETRI_TRANSITIONS=82} [2025-01-09 21:40:59,698 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -29 predicate places. [2025-01-09 21:40:59,699 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 82 transitions, 199 flow [2025-01-09 21:40:59,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 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:40:59,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,699 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:40:59,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:40:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 685804302, now seen corresponding path program 1 times [2025-01-09 21:40:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141546335] [2025-01-09 21:40:59,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:40:59,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:40:59,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:59,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:40:59,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:40:59,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:59,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:59,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:40:59,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:40:59,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:40:59,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:40:59,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:40:59,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:40:59,772 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:59,772 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:59,772 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-09 21:40:59,812 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:59,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 285 transitions, 678 flow [2025-01-09 21:40:59,841 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2025-01-09 21:40:59,841 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:40:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 469 events. 30/469 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1253 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 510. Up to 14 conditions per place. [2025-01-09 21:40:59,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 285 transitions, 678 flow [2025-01-09 21:40:59,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 123 transitions, 303 flow [2025-01-09 21:40:59,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:59,848 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:59,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:40:59,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:59,849 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:40:59,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:59,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:40:59,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1238770636, now seen corresponding path program 1 times [2025-01-09 21:40:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495179703] [2025-01-09 21:40:59,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:40:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:40:59,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,862 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:40:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495179703] [2025-01-09 21:40:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495179703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443246795] [2025-01-09 21:40:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 285 [2025-01-09 21:40:59,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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:40:59,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 285 [2025-01-09 21:40:59,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,938 INFO L124 PetriNetUnfolderBase]: 15/369 cut-off events. [2025-01-09 21:40:59,938 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-09 21:40:59,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 369 events. 15/369 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 859 event pairs, 7 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 400. Up to 55 conditions per place. [2025-01-09 21:40:59,939 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 16 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2025-01-09 21:40:59,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 120 transitions, 333 flow [2025-01-09 21:40:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2025-01-09 21:40:59,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526315789473684 [2025-01-09 21:40:59,941 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 303 flow. Second operand 3 states and 729 transitions. [2025-01-09 21:40:59,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 120 transitions, 333 flow [2025-01-09 21:40:59,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 120 transitions, 312 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,942 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 278 flow [2025-01-09 21:40:59,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2025-01-09 21:40:59,943 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2025-01-09 21:40:59,943 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 278 flow [2025-01-09 21:40:59,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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:40:59,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:40:59,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:40:59,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1858332636, now seen corresponding path program 1 times [2025-01-09 21:40:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071654964] [2025-01-09 21:40:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:40:59,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:40:59,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,955 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:40:59,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071654964] [2025-01-09 21:40:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071654964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525938777] [2025-01-09 21:40:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 285 [2025-01-09 21:40:59,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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:40:59,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 285 [2025-01-09 21:40:59,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,018 INFO L124 PetriNetUnfolderBase]: 8/330 cut-off events. [2025-01-09 21:41:00,019 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:41:00,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 330 events. 8/330 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 626 event pairs, 0 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 386. Up to 40 conditions per place. [2025-01-09 21:41:00,020 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 14 selfloop transitions, 1 changer transitions 24/114 dead transitions. [2025-01-09 21:41:00,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 302 flow [2025-01-09 21:41:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-01-09 21:41:00,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046783625730994 [2025-01-09 21:41:00,021 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 278 flow. Second operand 3 states and 688 transitions. [2025-01-09 21:41:00,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 302 flow [2025-01-09 21:41:00,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:00,023 INFO L231 Difference]: Finished difference. Result has 129 places, 90 transitions, 216 flow [2025-01-09 21:41:00,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=90} [2025-01-09 21:41:00,023 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -6 predicate places. [2025-01-09 21:41:00,024 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 90 transitions, 216 flow [2025-01-09 21:41:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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:41:00,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,024 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:41:00,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:00,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1024241707, now seen corresponding path program 1 times [2025-01-09 21:41:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247482919] [2025-01-09 21:41:00,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:41:00,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:41:00,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,073 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:41:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247482919] [2025-01-09 21:41:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247482919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47425471] [2025-01-09 21:41:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:00,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:00,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 285 [2025-01-09 21:41:00,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 90 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:41:00,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 285 [2025-01-09 21:41:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,130 INFO L124 PetriNetUnfolderBase]: 0/161 cut-off events. [2025-01-09 21:41:00,131 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:41:00,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 161 events. 0/161 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 71 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-01-09 21:41:00,131 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 10 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-01-09 21:41:00,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 89 transitions, 240 flow [2025-01-09 21:41:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 990 transitions. [2025-01-09 21:41:00,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868421052631579 [2025-01-09 21:41:00,133 INFO L175 Difference]: Start difference. First operand has 129 places, 90 transitions, 216 flow. Second operand 4 states and 990 transitions. [2025-01-09 21:41:00,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 89 transitions, 240 flow [2025-01-09 21:41:00,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 89 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,134 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 219 flow [2025-01-09 21:41:00,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2025-01-09 21:41:00,135 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -29 predicate places. [2025-01-09 21:41:00,135 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 219 flow [2025-01-09 21:41:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:41:00,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,135 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:41:00,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957059, now seen corresponding path program 1 times [2025-01-09 21:41:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264798320] [2025-01-09 21:41:00,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:41:00,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:41:00,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:00,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:41:00,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:41:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:00,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:00,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:41:00,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:41:00,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:41:00,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:41:00,161 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:00,162 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:00,162 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-09 21:41:00,197 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:00,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 321 transitions, 782 flow [2025-01-09 21:41:00,227 INFO L124 PetriNetUnfolderBase]: 34/532 cut-off events. [2025-01-09 21:41:00,228 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:41:00,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 532 events. 34/532 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1399 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 583. Up to 16 conditions per place. [2025-01-09 21:41:00,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 321 transitions, 782 flow [2025-01-09 21:41:00,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 130 transitions, 333 flow [2025-01-09 21:41:00,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:00,231 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:00,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:41:00,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:00,231 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:00,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:00,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash -239790932, now seen corresponding path program 1 times [2025-01-09 21:41:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-01-09 21:41:00,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:00,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:00,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,264 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:41:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-01-09 21:41:00,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894943284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53865731] [2025-01-09 21:41:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 321 [2025-01-09 21:41:00,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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:41:00,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 321 [2025-01-09 21:41:00,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,339 INFO L124 PetriNetUnfolderBase]: 17/418 cut-off events. [2025-01-09 21:41:00,339 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-09 21:41:00,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 418 events. 17/418 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 985 event pairs, 8 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 465. Up to 62 conditions per place. [2025-01-09 21:41:00,341 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 17 selfloop transitions, 2 changer transitions 1/127 dead transitions. [2025-01-09 21:41:00,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 365 flow [2025-01-09 21:41:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-01-09 21:41:00,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8515057113187954 [2025-01-09 21:41:00,342 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 333 flow. Second operand 3 states and 820 transitions. [2025-01-09 21:41:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 365 flow [2025-01-09 21:41:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 127 transitions, 334 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,344 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 298 flow [2025-01-09 21:41:00,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2025-01-09 21:41:00,345 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2025-01-09 21:41:00,345 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 298 flow [2025-01-09 21:41:00,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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:41:00,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:41:00,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1079400419, now seen corresponding path program 1 times [2025-01-09 21:41:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728451511] [2025-01-09 21:41:00,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:00,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:00,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,356 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:41:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728451511] [2025-01-09 21:41:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728451511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557834154] [2025-01-09 21:41:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 321 [2025-01-09 21:41:00,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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:41:00,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 321 [2025-01-09 21:41:00,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,423 INFO L124 PetriNetUnfolderBase]: 9/374 cut-off events. [2025-01-09 21:41:00,424 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:41:00,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 374 events. 9/374 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 725 event pairs, 0 based on Foata normal form. 8/365 useless extension candidates. Maximal degree in co-relation 440. Up to 45 conditions per place. [2025-01-09 21:41:00,425 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 15 selfloop transitions, 1 changer transitions 24/121 dead transitions. [2025-01-09 21:41:00,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 121 transitions, 324 flow [2025-01-09 21:41:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-01-09 21:41:00,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8026998961578401 [2025-01-09 21:41:00,427 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 298 flow. Second operand 3 states and 773 transitions. [2025-01-09 21:41:00,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 121 transitions, 324 flow [2025-01-09 21:41:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 121 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:00,428 INFO L231 Difference]: Finished difference. Result has 138 places, 97 transitions, 236 flow [2025-01-09 21:41:00,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2025-01-09 21:41:00,429 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2025-01-09 21:41:00,429 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 236 flow [2025-01-09 21:41:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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:41:00,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,429 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:41:00,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1900050922, now seen corresponding path program 1 times [2025-01-09 21:41:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047760843] [2025-01-09 21:41:00,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:41:00,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:41:00,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,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:41:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047760843] [2025-01-09 21:41:00,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047760843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155078370] [2025-01-09 21:41:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:00,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:00,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 321 [2025-01-09 21:41:00,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 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:41:00,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 321 [2025-01-09 21:41:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,544 INFO L124 PetriNetUnfolderBase]: 0/181 cut-off events. [2025-01-09 21:41:00,544 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:41:00,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 181 events. 0/181 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 83 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2025-01-09 21:41:00,545 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 11 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-01-09 21:41:00,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 96 transitions, 262 flow [2025-01-09 21:41:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1115 transitions. [2025-01-09 21:41:00,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868380062305296 [2025-01-09 21:41:00,547 INFO L175 Difference]: Start difference. First operand has 138 places, 97 transitions, 236 flow. Second operand 4 states and 1115 transitions. [2025-01-09 21:41:00,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 96 transitions, 262 flow [2025-01-09 21:41:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 96 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,548 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 239 flow [2025-01-09 21:41:00,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2025-01-09 21:41:00,548 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -29 predicate places. [2025-01-09 21:41:00,548 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 239 flow [2025-01-09 21:41:00,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 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:41:00,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,549 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:41:00,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:00,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -142367709, now seen corresponding path program 1 times [2025-01-09 21:41:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824292691] [2025-01-09 21:41:00,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:41:00,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:41:00,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:41:00,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:41:00,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:00,575 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:41:00,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:41:00,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:41:00,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:41:00,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:41:00,577 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:00,577 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:00,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-01-09 21:41:00,618 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:00,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 357 transitions, 890 flow [2025-01-09 21:41:00,653 INFO L124 PetriNetUnfolderBase]: 38/595 cut-off events. [2025-01-09 21:41:00,653 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:41:00,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 595 events. 38/595 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1589 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 657. Up to 18 conditions per place. [2025-01-09 21:41:00,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 357 transitions, 890 flow [2025-01-09 21:41:00,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 137 transitions, 365 flow [2025-01-09 21:41:00,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:00,656 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:00,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:41:00,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:00,657 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:00,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:00,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1808696588, now seen corresponding path program 1 times [2025-01-09 21:41:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710327427] [2025-01-09 21:41:00,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,668 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:41:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710327427] [2025-01-09 21:41:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710327427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69692683] [2025-01-09 21:41:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 357 [2025-01-09 21:41:00,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:00,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 357 [2025-01-09 21:41:00,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,782 INFO L124 PetriNetUnfolderBase]: 19/467 cut-off events. [2025-01-09 21:41:00,783 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-01-09 21:41:00,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 467 events. 19/467 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1129 event pairs, 9 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 531. Up to 69 conditions per place. [2025-01-09 21:41:00,785 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 18 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-01-09 21:41:00,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 399 flow [2025-01-09 21:41:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-01-09 21:41:00,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506069094304388 [2025-01-09 21:41:00,787 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 365 flow. Second operand 3 states and 911 transitions. [2025-01-09 21:41:00,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 399 flow [2025-01-09 21:41:00,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 134 transitions, 356 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,788 INFO L231 Difference]: Finished difference. Result has 153 places, 133 transitions, 318 flow [2025-01-09 21:41:00,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2025-01-09 21:41:00,789 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2025-01-09 21:41:00,789 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 318 flow [2025-01-09 21:41:00,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:41:00,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:41:00,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1777646462, now seen corresponding path program 1 times [2025-01-09 21:41:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-01-09 21:41:00,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:00,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:00,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,801 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:41:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-01-09 21:41:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905267986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039753068] [2025-01-09 21:41:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 357 [2025-01-09 21:41:00,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:41:00,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 357 [2025-01-09 21:41:00,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,872 INFO L124 PetriNetUnfolderBase]: 10/418 cut-off events. [2025-01-09 21:41:00,872 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:41:00,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 418 events. 10/418 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 825 event pairs, 0 based on Foata normal form. 9/408 useless extension candidates. Maximal degree in co-relation 494. Up to 50 conditions per place. [2025-01-09 21:41:00,874 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 16 selfloop transitions, 1 changer transitions 24/128 dead transitions. [2025-01-09 21:41:00,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 128 transitions, 346 flow [2025-01-09 21:41:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-01-09 21:41:00,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8011204481792717 [2025-01-09 21:41:00,875 INFO L175 Difference]: Start difference. First operand has 153 places, 133 transitions, 318 flow. Second operand 3 states and 858 transitions. [2025-01-09 21:41:00,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 128 transitions, 346 flow [2025-01-09 21:41:00,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:00,877 INFO L231 Difference]: Finished difference. Result has 147 places, 104 transitions, 256 flow [2025-01-09 21:41:00,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=147, PETRI_TRANSITIONS=104} [2025-01-09 21:41:00,877 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2025-01-09 21:41:00,877 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 104 transitions, 256 flow [2025-01-09 21:41:00,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:41:00,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,878 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:41:00,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2111053104, now seen corresponding path program 1 times [2025-01-09 21:41:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436613473] [2025-01-09 21:41:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:41:00,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:41:00,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,928 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:41:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436613473] [2025-01-09 21:41:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436613473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088884836] [2025-01-09 21:41:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:00,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:00,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 357 [2025-01-09 21:41:00,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 104 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 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:41:00,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 357 [2025-01-09 21:41:00,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,984 INFO L124 PetriNetUnfolderBase]: 0/201 cut-off events. [2025-01-09 21:41:00,984 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:41:00,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 201 events. 0/201 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 96 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2025-01-09 21:41:00,985 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 12 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2025-01-09 21:41:00,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 103 transitions, 284 flow [2025-01-09 21:41:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1240 transitions. [2025-01-09 21:41:00,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683473389355743 [2025-01-09 21:41:00,987 INFO L175 Difference]: Start difference. First operand has 147 places, 104 transitions, 256 flow. Second operand 4 states and 1240 transitions. [2025-01-09 21:41:00,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 103 transitions, 284 flow [2025-01-09 21:41:00,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 103 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,989 INFO L231 Difference]: Finished difference. Result has 124 places, 103 transitions, 259 flow [2025-01-09 21:41:00,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=124, PETRI_TRANSITIONS=103} [2025-01-09 21:41:00,989 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -29 predicate places. [2025-01-09 21:41:00,989 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 103 transitions, 259 flow [2025-01-09 21:41:00,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 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:41:00,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,990 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:41:00,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -954370386, now seen corresponding path program 1 times [2025-01-09 21:41:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620842161] [2025-01-09 21:41:00,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:41:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:41:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:01,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:41:01,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:41:01,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:01,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:01,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:41:01,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:41:01,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:41:01,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:41:01,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:41:01,021 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:01,022 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:01,022 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-01-09 21:41:01,065 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 393 transitions, 1002 flow [2025-01-09 21:41:01,106 INFO L124 PetriNetUnfolderBase]: 42/658 cut-off events. [2025-01-09 21:41:01,106 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-09 21:41:01,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 658 events. 42/658 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1746 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 732. Up to 20 conditions per place. [2025-01-09 21:41:01,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 393 transitions, 1002 flow [2025-01-09 21:41:01,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 144 transitions, 399 flow [2025-01-09 21:41:01,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:01,110 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:01,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:41:01,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:01,111 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:01,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:01,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1205701396, now seen corresponding path program 1 times [2025-01-09 21:41:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-01-09 21:41:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:01,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,123 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:41:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-01-09 21:41:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239626672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481005791] [2025-01-09 21:41:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 393 [2025-01-09 21:41:01,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 144 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:41:01,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 393 [2025-01-09 21:41:01,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,255 INFO L124 PetriNetUnfolderBase]: 21/516 cut-off events. [2025-01-09 21:41:01,255 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-01-09 21:41:01,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 516 events. 21/516 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1249 event pairs, 10 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 598. Up to 76 conditions per place. [2025-01-09 21:41:01,257 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 19 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2025-01-09 21:41:01,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 435 flow [2025-01-09 21:41:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1002 transitions. [2025-01-09 21:41:01,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8498727735368957 [2025-01-09 21:41:01,259 INFO L175 Difference]: Start difference. First operand has 162 places, 144 transitions, 399 flow. Second operand 3 states and 1002 transitions. [2025-01-09 21:41:01,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 435 flow [2025-01-09 21:41:01,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 378 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,262 INFO L231 Difference]: Finished difference. Result has 162 places, 140 transitions, 338 flow [2025-01-09 21:41:01,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=162, PETRI_TRANSITIONS=140} [2025-01-09 21:41:01,262 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 0 predicate places. [2025-01-09 21:41:01,262 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 140 transitions, 338 flow [2025-01-09 21:41:01,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:41:01,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:41:01,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:01,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -236405493, now seen corresponding path program 1 times [2025-01-09 21:41:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965024474] [2025-01-09 21:41:01,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:01,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:01,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,277 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:41:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965024474] [2025-01-09 21:41:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965024474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833059099] [2025-01-09 21:41:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 393 [2025-01-09 21:41:01,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 140 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 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:41:01,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 393 [2025-01-09 21:41:01,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,374 INFO L124 PetriNetUnfolderBase]: 11/462 cut-off events. [2025-01-09 21:41:01,374 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:41:01,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 462 events. 11/462 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 923 event pairs, 0 based on Foata normal form. 10/451 useless extension candidates. Maximal degree in co-relation 548. Up to 55 conditions per place. [2025-01-09 21:41:01,376 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 17 selfloop transitions, 1 changer transitions 24/135 dead transitions. [2025-01-09 21:41:01,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 135 transitions, 368 flow [2025-01-09 21:41:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-01-09 21:41:01,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7998303647158609 [2025-01-09 21:41:01,378 INFO L175 Difference]: Start difference. First operand has 162 places, 140 transitions, 338 flow. Second operand 3 states and 943 transitions. [2025-01-09 21:41:01,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 135 transitions, 368 flow [2025-01-09 21:41:01,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 135 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:01,380 INFO L231 Difference]: Finished difference. Result has 156 places, 111 transitions, 276 flow [2025-01-09 21:41:01,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=156, PETRI_TRANSITIONS=111} [2025-01-09 21:41:01,381 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -6 predicate places. [2025-01-09 21:41:01,381 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 111 transitions, 276 flow [2025-01-09 21:41:01,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 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:41:01,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,382 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:41:01,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:01,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1494032125, now seen corresponding path program 1 times [2025-01-09 21:41:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-09 21:41:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:41:01,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:41:01,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,447 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:41:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-09 21:41:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447889950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901838920] [2025-01-09 21:41:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:01,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:01,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 393 [2025-01-09 21:41:01,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 111 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 340.75) internal successors, (1363), 4 states have internal predecessors, (1363), 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:41:01,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 393 [2025-01-09 21:41:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,519 INFO L124 PetriNetUnfolderBase]: 0/221 cut-off events. [2025-01-09 21:41:01,519 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-09 21:41:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 221 events. 0/221 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 107 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2025-01-09 21:41:01,519 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 13 selfloop transitions, 3 changer transitions 0/110 dead transitions. [2025-01-09 21:41:01,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 110 transitions, 306 flow [2025-01-09 21:41:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1365 transitions. [2025-01-09 21:41:01,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683206106870229 [2025-01-09 21:41:01,522 INFO L175 Difference]: Start difference. First operand has 156 places, 111 transitions, 276 flow. Second operand 4 states and 1365 transitions. [2025-01-09 21:41:01,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 110 transitions, 306 flow [2025-01-09 21:41:01,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 110 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,524 INFO L231 Difference]: Finished difference. Result has 133 places, 110 transitions, 279 flow [2025-01-09 21:41:01,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=133, PETRI_TRANSITIONS=110} [2025-01-09 21:41:01,525 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -29 predicate places. [2025-01-09 21:41:01,525 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 110 transitions, 279 flow [2025-01-09 21:41:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 340.75) internal successors, (1363), 4 states have internal predecessors, (1363), 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:41:01,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,525 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:41:01,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:01,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1844500508, now seen corresponding path program 1 times [2025-01-09 21:41:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964853387] [2025-01-09 21:41:01,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:41:01,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:41:01,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:01,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:41:01,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:41:01,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:01,573 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:01,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-09 21:41:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-01-09 21:41:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-01-09 21:41:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-01-09 21:41:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-01-09 21:41:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-01-09 21:41:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-01-09 21:41:01,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:41:01,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:01,576 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:01,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-01-09 21:41:01,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 429 transitions, 1118 flow [2025-01-09 21:41:01,677 INFO L124 PetriNetUnfolderBase]: 46/721 cut-off events. [2025-01-09 21:41:01,677 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-01-09 21:41:01,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 721 events. 46/721 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1967 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 808. Up to 22 conditions per place. [2025-01-09 21:41:01,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 429 transitions, 1118 flow [2025-01-09 21:41:01,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 151 transitions, 435 flow [2025-01-09 21:41:01,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:01,682 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:01,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:41:01,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:01,683 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:01,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:01,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:01,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash -693050292, now seen corresponding path program 1 times [2025-01-09 21:41:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713038913] [2025-01-09 21:41:01,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:01,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:01,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,695 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:41:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713038913] [2025-01-09 21:41:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713038913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200323264] [2025-01-09 21:41:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 429 [2025-01-09 21:41:01,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 151 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 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:41:01,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 429 [2025-01-09 21:41:01,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,791 INFO L124 PetriNetUnfolderBase]: 23/565 cut-off events. [2025-01-09 21:41:01,791 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-01-09 21:41:01,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 565 events. 23/565 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1480 event pairs, 11 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 666. Up to 83 conditions per place. [2025-01-09 21:41:01,794 INFO L140 encePairwiseOnDemand]: 424/429 looper letters, 20 selfloop transitions, 2 changer transitions 1/148 dead transitions. [2025-01-09 21:41:01,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 148 transitions, 473 flow [2025-01-09 21:41:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1093 transitions. [2025-01-09 21:41:01,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492618492618492 [2025-01-09 21:41:01,796 INFO L175 Difference]: Start difference. First operand has 171 places, 151 transitions, 435 flow. Second operand 3 states and 1093 transitions. [2025-01-09 21:41:01,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 148 transitions, 473 flow [2025-01-09 21:41:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 148 transitions, 400 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,798 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 358 flow [2025-01-09 21:41:01,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2025-01-09 21:41:01,799 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2025-01-09 21:41:01,799 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 358 flow [2025-01-09 21:41:01,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 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:41:01,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:41:01,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:01,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -750644808, now seen corresponding path program 1 times [2025-01-09 21:41:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500149430] [2025-01-09 21:41:01,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,836 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:41:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500149430] [2025-01-09 21:41:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500149430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108913745] [2025-01-09 21:41:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 429 [2025-01-09 21:41:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 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:41:01,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 429 [2025-01-09 21:41:01,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,918 INFO L124 PetriNetUnfolderBase]: 12/506 cut-off events. [2025-01-09 21:41:01,919 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-09 21:41:01,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 506 events. 12/506 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1107 event pairs, 0 based on Foata normal form. 11/494 useless extension candidates. Maximal degree in co-relation 602. Up to 60 conditions per place. [2025-01-09 21:41:01,920 INFO L140 encePairwiseOnDemand]: 423/429 looper letters, 18 selfloop transitions, 1 changer transitions 24/142 dead transitions. [2025-01-09 21:41:01,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 142 transitions, 390 flow [2025-01-09 21:41:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2025-01-09 21:41:01,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7987567987567987 [2025-01-09 21:41:01,922 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 358 flow. Second operand 3 states and 1028 transitions. [2025-01-09 21:41:01,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 142 transitions, 390 flow [2025-01-09 21:41:01,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 142 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:01,924 INFO L231 Difference]: Finished difference. Result has 165 places, 118 transitions, 296 flow [2025-01-09 21:41:01,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=165, PETRI_TRANSITIONS=118} [2025-01-09 21:41:01,925 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, -6 predicate places. [2025-01-09 21:41:01,925 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 118 transitions, 296 flow [2025-01-09 21:41:01,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 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:41:01,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,926 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:41:01,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 912790609, now seen corresponding path program 1 times [2025-01-09 21:41:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904102101] [2025-01-09 21:41:01,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:41:01,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:41:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,978 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:41:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904102101] [2025-01-09 21:41:01,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904102101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:01,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132299449] [2025-01-09 21:41:01,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:01,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:01,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:02,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 429 [2025-01-09 21:41:02,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 118 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 372.0) internal successors, (1488), 4 states have internal predecessors, (1488), 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:41:02,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 429 [2025-01-09 21:41:02,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,040 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2025-01-09 21:41:02,040 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:41:02,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 241 events. 0/241 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 120 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2025-01-09 21:41:02,041 INFO L140 encePairwiseOnDemand]: 425/429 looper letters, 14 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2025-01-09 21:41:02,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 117 transitions, 328 flow [2025-01-09 21:41:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1490 transitions. [2025-01-09 21:41:02,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682983682983683 [2025-01-09 21:41:02,043 INFO L175 Difference]: Start difference. First operand has 165 places, 118 transitions, 296 flow. Second operand 4 states and 1490 transitions. [2025-01-09 21:41:02,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 117 transitions, 328 flow [2025-01-09 21:41:02,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 117 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,045 INFO L231 Difference]: Finished difference. Result has 142 places, 117 transitions, 299 flow [2025-01-09 21:41:02,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=142, PETRI_TRANSITIONS=117} [2025-01-09 21:41:02,045 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, -29 predicate places. [2025-01-09 21:41:02,046 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 117 transitions, 299 flow [2025-01-09 21:41:02,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 372.0) internal successors, (1488), 4 states have internal predecessors, (1488), 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:41:02,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,046 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:41:02,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:02,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1854525499, now seen corresponding path program 1 times [2025-01-09 21:41:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260363996] [2025-01-09 21:41:02,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:41:02,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:41:02,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:02,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:41:02,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:41:02,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:02,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:02,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:41:02,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:41:02,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:41:02,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:41:02,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:02,084 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:02,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-01-09 21:41:02,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:02,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 465 transitions, 1238 flow [2025-01-09 21:41:02,185 INFO L124 PetriNetUnfolderBase]: 50/784 cut-off events. [2025-01-09 21:41:02,186 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-01-09 21:41:02,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 784 events. 50/784 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2183 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 885. Up to 24 conditions per place. [2025-01-09 21:41:02,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 475 places, 465 transitions, 1238 flow [2025-01-09 21:41:02,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 158 transitions, 473 flow [2025-01-09 21:41:02,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:02,190 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:02,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 21:41:02,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:02,191 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:02,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:02,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:02,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -948317396, now seen corresponding path program 1 times [2025-01-09 21:41:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851143848] [2025-01-09 21:41:02,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:02,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:02,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,203 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:41:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851143848] [2025-01-09 21:41:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851143848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824511029] [2025-01-09 21:41:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 465 [2025-01-09 21:41:02,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 158 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:41:02,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 465 [2025-01-09 21:41:02,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,324 INFO L124 PetriNetUnfolderBase]: 25/614 cut-off events. [2025-01-09 21:41:02,324 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-01-09 21:41:02,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 614 events. 25/614 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1638 event pairs, 12 based on Foata normal form. 1/562 useless extension candidates. Maximal degree in co-relation 735. Up to 90 conditions per place. [2025-01-09 21:41:02,327 INFO L140 encePairwiseOnDemand]: 460/465 looper letters, 21 selfloop transitions, 2 changer transitions 1/155 dead transitions. [2025-01-09 21:41:02,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 155 transitions, 513 flow [2025-01-09 21:41:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-01-09 21:41:02,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487455197132616 [2025-01-09 21:41:02,330 INFO L175 Difference]: Start difference. First operand has 180 places, 158 transitions, 473 flow. Second operand 3 states and 1184 transitions. [2025-01-09 21:41:02,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 155 transitions, 513 flow [2025-01-09 21:41:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 155 transitions, 422 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,332 INFO L231 Difference]: Finished difference. Result has 180 places, 154 transitions, 378 flow [2025-01-09 21:41:02,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2025-01-09 21:41:02,333 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 0 predicate places. [2025-01-09 21:41:02,333 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 378 flow [2025-01-09 21:41:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:41:02,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:41:02,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 974602889, now seen corresponding path program 1 times [2025-01-09 21:41:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635044128] [2025-01-09 21:41:02,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:02,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,346 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:41:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635044128] [2025-01-09 21:41:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635044128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735988690] [2025-01-09 21:41:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 465 [2025-01-09 21:41:02,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 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:41:02,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 465 [2025-01-09 21:41:02,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,465 INFO L124 PetriNetUnfolderBase]: 13/550 cut-off events. [2025-01-09 21:41:02,465 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-09 21:41:02,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 550 events. 13/550 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1213 event pairs, 0 based on Foata normal form. 12/537 useless extension candidates. Maximal degree in co-relation 656. Up to 65 conditions per place. [2025-01-09 21:41:02,468 INFO L140 encePairwiseOnDemand]: 459/465 looper letters, 19 selfloop transitions, 1 changer transitions 24/149 dead transitions. [2025-01-09 21:41:02,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 149 transitions, 412 flow [2025-01-09 21:41:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-01-09 21:41:02,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978494623655914 [2025-01-09 21:41:02,470 INFO L175 Difference]: Start difference. First operand has 180 places, 154 transitions, 378 flow. Second operand 3 states and 1113 transitions. [2025-01-09 21:41:02,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 149 transitions, 412 flow [2025-01-09 21:41:02,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 149 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:02,471 INFO L231 Difference]: Finished difference. Result has 174 places, 125 transitions, 316 flow [2025-01-09 21:41:02,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=174, PETRI_TRANSITIONS=125} [2025-01-09 21:41:02,472 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -6 predicate places. [2025-01-09 21:41:02,472 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 125 transitions, 316 flow [2025-01-09 21:41:02,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 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:41:02,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,472 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:41:02,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:02,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1215782356, now seen corresponding path program 1 times [2025-01-09 21:41:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026923131] [2025-01-09 21:41:02,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:41:02,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:41:02,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,547 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:41:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026923131] [2025-01-09 21:41:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026923131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764990248] [2025-01-09 21:41:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:02,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:02,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 465 [2025-01-09 21:41:02,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 125 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 403.25) internal successors, (1613), 4 states have internal predecessors, (1613), 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:41:02,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 465 [2025-01-09 21:41:02,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,618 INFO L124 PetriNetUnfolderBase]: 0/261 cut-off events. [2025-01-09 21:41:02,619 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-09 21:41:02,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 261 events. 0/261 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 131 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2025-01-09 21:41:02,619 INFO L140 encePairwiseOnDemand]: 461/465 looper letters, 15 selfloop transitions, 3 changer transitions 0/124 dead transitions. [2025-01-09 21:41:02,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 124 transitions, 350 flow [2025-01-09 21:41:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1615 transitions. [2025-01-09 21:41:02,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682795698924731 [2025-01-09 21:41:02,621 INFO L175 Difference]: Start difference. First operand has 174 places, 125 transitions, 316 flow. Second operand 4 states and 1615 transitions. [2025-01-09 21:41:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 124 transitions, 350 flow [2025-01-09 21:41:02,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 124 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,623 INFO L231 Difference]: Finished difference. Result has 151 places, 124 transitions, 319 flow [2025-01-09 21:41:02,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=151, PETRI_TRANSITIONS=124} [2025-01-09 21:41:02,624 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -29 predicate places. [2025-01-09 21:41:02,624 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 124 transitions, 319 flow [2025-01-09 21:41:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 403.25) internal successors, (1613), 4 states have internal predecessors, (1613), 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:41:02,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,624 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:41:02,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1696372305, now seen corresponding path program 1 times [2025-01-09 21:41:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239986159] [2025-01-09 21:41:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:41:02,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:41:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:41:02,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:41:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:02,665 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-01-09 21:41:02,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-01-09 21:41:02,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-01-09 21:41:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 21:41:02,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:02,667 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:02,667 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-01-09 21:41:02,724 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:02,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 512 places, 501 transitions, 1362 flow [2025-01-09 21:41:02,782 INFO L124 PetriNetUnfolderBase]: 54/847 cut-off events. [2025-01-09 21:41:02,783 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-01-09 21:41:02,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 847 events. 54/847 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2327 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 963. Up to 26 conditions per place. [2025-01-09 21:41:02,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 512 places, 501 transitions, 1362 flow [2025-01-09 21:41:02,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 165 transitions, 513 flow [2025-01-09 21:41:02,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:02,789 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:02,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:41:02,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:02,790 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:02,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:02,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:02,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1971502708, now seen corresponding path program 1 times [2025-01-09 21:41:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969618982] [2025-01-09 21:41:02,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:02,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:02,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,803 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:41:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969618982] [2025-01-09 21:41:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969618982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174900399] [2025-01-09 21:41:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 501 [2025-01-09 21:41:02,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 165 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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:41:02,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 501 [2025-01-09 21:41:02,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,969 INFO L124 PetriNetUnfolderBase]: 27/663 cut-off events. [2025-01-09 21:41:02,969 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2025-01-09 21:41:02,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 663 events. 27/663 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1652 event pairs, 13 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 805. Up to 97 conditions per place. [2025-01-09 21:41:02,972 INFO L140 encePairwiseOnDemand]: 496/501 looper letters, 22 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2025-01-09 21:41:02,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 162 transitions, 555 flow [2025-01-09 21:41:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-01-09 21:41:02,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8483033932135728 [2025-01-09 21:41:02,975 INFO L175 Difference]: Start difference. First operand has 189 places, 165 transitions, 513 flow. Second operand 3 states and 1275 transitions. [2025-01-09 21:41:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 162 transitions, 555 flow [2025-01-09 21:41:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 162 transitions, 444 flow, removed 55 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,978 INFO L231 Difference]: Finished difference. Result has 189 places, 161 transitions, 398 flow [2025-01-09 21:41:02,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=189, PETRI_TRANSITIONS=161} [2025-01-09 21:41:02,979 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 0 predicate places. [2025-01-09 21:41:02,979 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 161 transitions, 398 flow [2025-01-09 21:41:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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:41:02,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 21:41:02,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 644370302, now seen corresponding path program 1 times [2025-01-09 21:41:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081121188] [2025-01-09 21:41:02,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:02,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:02,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,993 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:41:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081121188] [2025-01-09 21:41:02,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081121188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505520184] [2025-01-09 21:41:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 501 [2025-01-09 21:41:03,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 161 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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:41:03,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 501 [2025-01-09 21:41:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,100 INFO L124 PetriNetUnfolderBase]: 14/594 cut-off events. [2025-01-09 21:41:03,100 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-09 21:41:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 594 events. 14/594 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1221 event pairs, 0 based on Foata normal form. 13/580 useless extension candidates. Maximal degree in co-relation 710. Up to 70 conditions per place. [2025-01-09 21:41:03,103 INFO L140 encePairwiseOnDemand]: 495/501 looper letters, 20 selfloop transitions, 1 changer transitions 24/156 dead transitions. [2025-01-09 21:41:03,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 156 transitions, 434 flow [2025-01-09 21:41:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2025-01-09 21:41:03,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7970725216234198 [2025-01-09 21:41:03,105 INFO L175 Difference]: Start difference. First operand has 189 places, 161 transitions, 398 flow. Second operand 3 states and 1198 transitions. [2025-01-09 21:41:03,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 156 transitions, 434 flow [2025-01-09 21:41:03,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 156 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:03,108 INFO L231 Difference]: Finished difference. Result has 183 places, 132 transitions, 336 flow [2025-01-09 21:41:03,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=183, PETRI_TRANSITIONS=132} [2025-01-09 21:41:03,108 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, -6 predicate places. [2025-01-09 21:41:03,108 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 132 transitions, 336 flow [2025-01-09 21:41:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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:41:03,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,109 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 21:41:03,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1646886286, now seen corresponding path program 1 times [2025-01-09 21:41:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596954943] [2025-01-09 21:41:03,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 21:41:03,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 21:41:03,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,177 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:41:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596954943] [2025-01-09 21:41:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596954943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838524008] [2025-01-09 21:41:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:03,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:03,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 501 [2025-01-09 21:41:03,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 132 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 434.5) internal successors, (1738), 4 states have internal predecessors, (1738), 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:41:03,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 501 [2025-01-09 21:41:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,264 INFO L124 PetriNetUnfolderBase]: 0/281 cut-off events. [2025-01-09 21:41:03,264 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-01-09 21:41:03,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 281 events. 0/281 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 144 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2025-01-09 21:41:03,265 INFO L140 encePairwiseOnDemand]: 497/501 looper letters, 16 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-01-09 21:41:03,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 131 transitions, 372 flow [2025-01-09 21:41:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1740 transitions. [2025-01-09 21:41:03,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682634730538922 [2025-01-09 21:41:03,266 INFO L175 Difference]: Start difference. First operand has 183 places, 132 transitions, 336 flow. Second operand 4 states and 1740 transitions. [2025-01-09 21:41:03,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 131 transitions, 372 flow [2025-01-09 21:41:03,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 131 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:03,268 INFO L231 Difference]: Finished difference. Result has 160 places, 131 transitions, 339 flow [2025-01-09 21:41:03,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=160, PETRI_TRANSITIONS=131} [2025-01-09 21:41:03,269 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, -29 predicate places. [2025-01-09 21:41:03,270 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 131 transitions, 339 flow [2025-01-09 21:41:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 434.5) internal successors, (1738), 4 states have internal predecessors, (1738), 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:41:03,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,274 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 21:41:03,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -821496952, now seen corresponding path program 1 times [2025-01-09 21:41:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-09 21:41:03,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:41:03,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:41:03,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:03,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:41:03,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:41:03,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:03,328 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:03,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-01-09 21:41:03,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-01-09 21:41:03,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-01-09 21:41:03,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-01-09 21:41:03,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-01-09 21:41:03,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 21:41:03,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:03,330 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:03,330 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-01-09 21:41:03,389 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:03,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 549 places, 537 transitions, 1490 flow [2025-01-09 21:41:03,491 INFO L124 PetriNetUnfolderBase]: 58/910 cut-off events. [2025-01-09 21:41:03,491 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-01-09 21:41:03,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 910 events. 58/910 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2605 event pairs, 0 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1042. Up to 28 conditions per place. [2025-01-09 21:41:03,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 549 places, 537 transitions, 1490 flow [2025-01-09 21:41:03,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 172 transitions, 555 flow [2025-01-09 21:41:03,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:03,496 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:03,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:41:03,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:03,498 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:03,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:03,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:03,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 532361068, now seen corresponding path program 1 times [2025-01-09 21:41:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-01-09 21:41:03,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:03,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,512 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:41:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-01-09 21:41:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224387938] [2025-01-09 21:41:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 537 [2025-01-09 21:41:03,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 172 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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:41:03,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 537 [2025-01-09 21:41:03,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,689 INFO L124 PetriNetUnfolderBase]: 29/712 cut-off events. [2025-01-09 21:41:03,690 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-01-09 21:41:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 712 events. 29/712 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1849 event pairs, 14 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 876. Up to 104 conditions per place. [2025-01-09 21:41:03,695 INFO L140 encePairwiseOnDemand]: 532/537 looper letters, 23 selfloop transitions, 2 changer transitions 1/169 dead transitions. [2025-01-09 21:41:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 169 transitions, 599 flow [2025-01-09 21:41:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2025-01-09 21:41:03,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479205462445686 [2025-01-09 21:41:03,698 INFO L175 Difference]: Start difference. First operand has 198 places, 172 transitions, 555 flow. Second operand 3 states and 1366 transitions. [2025-01-09 21:41:03,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 169 transitions, 599 flow [2025-01-09 21:41:03,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 169 transitions, 466 flow, removed 66 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:03,701 INFO L231 Difference]: Finished difference. Result has 198 places, 168 transitions, 418 flow [2025-01-09 21:41:03,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=537, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=198, PETRI_TRANSITIONS=168} [2025-01-09 21:41:03,702 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2025-01-09 21:41:03,702 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 168 transitions, 418 flow [2025-01-09 21:41:03,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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:41:03,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 21:41:03,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:03,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1741342569, now seen corresponding path program 1 times [2025-01-09 21:41:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-01-09 21:41:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,720 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:41:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-01-09 21:41:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726946089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293276082] [2025-01-09 21:41:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:03,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 537 [2025-01-09 21:41:03,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 168 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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:41:03,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 537 [2025-01-09 21:41:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,853 INFO L124 PetriNetUnfolderBase]: 15/638 cut-off events. [2025-01-09 21:41:03,854 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-09 21:41:03,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 638 events. 15/638 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1361 event pairs, 0 based on Foata normal form. 14/623 useless extension candidates. Maximal degree in co-relation 764. Up to 75 conditions per place. [2025-01-09 21:41:03,857 INFO L140 encePairwiseOnDemand]: 531/537 looper letters, 21 selfloop transitions, 1 changer transitions 24/163 dead transitions. [2025-01-09 21:41:03,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 163 transitions, 456 flow [2025-01-09 21:41:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-01-09 21:41:03,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7963997517070143 [2025-01-09 21:41:03,859 INFO L175 Difference]: Start difference. First operand has 198 places, 168 transitions, 418 flow. Second operand 3 states and 1283 transitions. [2025-01-09 21:41:03,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 163 transitions, 456 flow [2025-01-09 21:41:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 163 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:03,861 INFO L231 Difference]: Finished difference. Result has 192 places, 139 transitions, 356 flow [2025-01-09 21:41:03,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=537, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=192, PETRI_TRANSITIONS=139} [2025-01-09 21:41:03,861 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -6 predicate places. [2025-01-09 21:41:03,863 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 139 transitions, 356 flow [2025-01-09 21:41:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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:41:03,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,863 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 21:41:03,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1527540599, now seen corresponding path program 1 times [2025-01-09 21:41:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-09 21:41:03,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 21:41:03,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 21:41:03,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-09 21:41:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933887511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:03,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683644857] [2025-01-09 21:41:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:03,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:03,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:04,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 537 [2025-01-09 21:41:04,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 139 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 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:41:04,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 537 [2025-01-09 21:41:04,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,062 INFO L124 PetriNetUnfolderBase]: 0/301 cut-off events. [2025-01-09 21:41:04,062 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-01-09 21:41:04,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 301 events. 0/301 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 155 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2025-01-09 21:41:04,063 INFO L140 encePairwiseOnDemand]: 533/537 looper letters, 17 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-01-09 21:41:04,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 138 transitions, 394 flow [2025-01-09 21:41:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1865 transitions. [2025-01-09 21:41:04,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682495344506518 [2025-01-09 21:41:04,064 INFO L175 Difference]: Start difference. First operand has 192 places, 139 transitions, 356 flow. Second operand 4 states and 1865 transitions. [2025-01-09 21:41:04,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 138 transitions, 394 flow [2025-01-09 21:41:04,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 138 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,066 INFO L231 Difference]: Finished difference. Result has 169 places, 138 transitions, 359 flow [2025-01-09 21:41:04,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=537, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=169, PETRI_TRANSITIONS=138} [2025-01-09 21:41:04,066 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -29 predicate places. [2025-01-09 21:41:04,067 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 138 transitions, 359 flow [2025-01-09 21:41:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 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:41:04,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,067 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 21:41:04,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1343123306, now seen corresponding path program 1 times [2025-01-09 21:41:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574153093] [2025-01-09 21:41:04,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:41:04,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:41:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:04,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:41:04,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:41:04,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:04,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:41:04,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:41:04,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 21:41:04,122 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:04,122 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:04,123 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-01-09 21:41:04,213 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 586 places, 573 transitions, 1622 flow [2025-01-09 21:41:04,286 INFO L124 PetriNetUnfolderBase]: 62/973 cut-off events. [2025-01-09 21:41:04,286 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2025-01-09 21:41:04,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 973 events. 62/973 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2771 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1122. Up to 30 conditions per place. [2025-01-09 21:41:04,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 586 places, 573 transitions, 1622 flow [2025-01-09 21:41:04,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 179 transitions, 599 flow [2025-01-09 21:41:04,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:04,292 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:04,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:41:04,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:04,293 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:04,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:04,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:04,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2026660660, now seen corresponding path program 1 times [2025-01-09 21:41:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943712514] [2025-01-09 21:41:04,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,315 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:41:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943712514] [2025-01-09 21:41:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943712514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113723252] [2025-01-09 21:41:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 573 [2025-01-09 21:41:04,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 179 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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:41:04,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 573 [2025-01-09 21:41:04,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,492 INFO L124 PetriNetUnfolderBase]: 31/761 cut-off events. [2025-01-09 21:41:04,493 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-01-09 21:41:04,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 761 events. 31/761 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1986 event pairs, 15 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 948. Up to 111 conditions per place. [2025-01-09 21:41:04,498 INFO L140 encePairwiseOnDemand]: 568/573 looper letters, 24 selfloop transitions, 2 changer transitions 1/176 dead transitions. [2025-01-09 21:41:04,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 176 transitions, 645 flow [2025-01-09 21:41:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-01-09 21:41:04,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847585805700989 [2025-01-09 21:41:04,500 INFO L175 Difference]: Start difference. First operand has 207 places, 179 transitions, 599 flow. Second operand 3 states and 1457 transitions. [2025-01-09 21:41:04,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 176 transitions, 645 flow [2025-01-09 21:41:04,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 176 transitions, 488 flow, removed 78 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,503 INFO L231 Difference]: Finished difference. Result has 207 places, 175 transitions, 438 flow [2025-01-09 21:41:04,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=207, PETRI_TRANSITIONS=175} [2025-01-09 21:41:04,503 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2025-01-09 21:41:04,503 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 175 transitions, 438 flow [2025-01-09 21:41:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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:41:04,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 21:41:04,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1887568428, now seen corresponding path program 1 times [2025-01-09 21:41:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531858594] [2025-01-09 21:41:04,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,518 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:41:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531858594] [2025-01-09 21:41:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531858594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882756605] [2025-01-09 21:41:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 573 [2025-01-09 21:41:04,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 175 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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:41:04,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 573 [2025-01-09 21:41:04,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,629 INFO L124 PetriNetUnfolderBase]: 16/682 cut-off events. [2025-01-09 21:41:04,629 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-01-09 21:41:04,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 682 events. 16/682 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1463 event pairs, 0 based on Foata normal form. 15/666 useless extension candidates. Maximal degree in co-relation 818. Up to 80 conditions per place. [2025-01-09 21:41:04,632 INFO L140 encePairwiseOnDemand]: 567/573 looper letters, 22 selfloop transitions, 1 changer transitions 24/170 dead transitions. [2025-01-09 21:41:04,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 170 transitions, 478 flow [2025-01-09 21:41:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-01-09 21:41:04,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7958115183246073 [2025-01-09 21:41:04,634 INFO L175 Difference]: Start difference. First operand has 207 places, 175 transitions, 438 flow. Second operand 3 states and 1368 transitions. [2025-01-09 21:41:04,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 170 transitions, 478 flow [2025-01-09 21:41:04,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 170 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:04,636 INFO L231 Difference]: Finished difference. Result has 201 places, 146 transitions, 376 flow [2025-01-09 21:41:04,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=201, PETRI_TRANSITIONS=146} [2025-01-09 21:41:04,636 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2025-01-09 21:41:04,636 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 146 transitions, 376 flow [2025-01-09 21:41:04,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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:41:04,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,637 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 21:41:04,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:04,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1709850855, now seen corresponding path program 1 times [2025-01-09 21:41:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542106048] [2025-01-09 21:41:04,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:41:04,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:41:04,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,698 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:41:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542106048] [2025-01-09 21:41:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542106048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041358785] [2025-01-09 21:41:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:04,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:04,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 573 [2025-01-09 21:41:04,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 146 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 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:41:04,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 573 [2025-01-09 21:41:04,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,777 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2025-01-09 21:41:04,777 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-09 21:41:04,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 321 events. 0/321 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 167 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2025-01-09 21:41:04,777 INFO L140 encePairwiseOnDemand]: 569/573 looper letters, 18 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-01-09 21:41:04,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 145 transitions, 416 flow [2025-01-09 21:41:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1990 transitions. [2025-01-09 21:41:04,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868237347294939 [2025-01-09 21:41:04,778 INFO L175 Difference]: Start difference. First operand has 201 places, 146 transitions, 376 flow. Second operand 4 states and 1990 transitions. [2025-01-09 21:41:04,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 145 transitions, 416 flow [2025-01-09 21:41:04,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 145 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,780 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 379 flow [2025-01-09 21:41:04,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2025-01-09 21:41:04,780 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -29 predicate places. [2025-01-09 21:41:04,780 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 379 flow [2025-01-09 21:41:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 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:41:04,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,781 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 21:41:04,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1520647689, now seen corresponding path program 1 times [2025-01-09 21:41:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786168880] [2025-01-09 21:41:04,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 21:41:04,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 21:41:04,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:04,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 21:41:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 21:41:04,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:04,828 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 22 remaining) [2025-01-09 21:41:04,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:41:04,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:41:04,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 21:41:04,829 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:04,829 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:04,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-01-09 21:41:04,889 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:04,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 609 transitions, 1758 flow [2025-01-09 21:41:04,966 INFO L124 PetriNetUnfolderBase]: 66/1036 cut-off events. [2025-01-09 21:41:04,966 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2025-01-09 21:41:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 1036 events. 66/1036 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2897 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1203. Up to 32 conditions per place. [2025-01-09 21:41:04,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 609 transitions, 1758 flow [2025-01-09 21:41:04,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 186 transitions, 645 flow [2025-01-09 21:41:04,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:04,973 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:04,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:41:04,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:04,973 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:04,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:04,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:04,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1058633300, now seen corresponding path program 1 times [2025-01-09 21:41:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434859188] [2025-01-09 21:41:04,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:04,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:04,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,985 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:41:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434859188] [2025-01-09 21:41:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434859188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691652916] [2025-01-09 21:41:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:05,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 609 [2025-01-09 21:41:05,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 186 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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:41:05,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 609 [2025-01-09 21:41:05,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,157 INFO L124 PetriNetUnfolderBase]: 33/810 cut-off events. [2025-01-09 21:41:05,157 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2025-01-09 21:41:05,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 810 events. 33/810 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2135 event pairs, 16 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 1021. Up to 118 conditions per place. [2025-01-09 21:41:05,161 INFO L140 encePairwiseOnDemand]: 604/609 looper letters, 25 selfloop transitions, 2 changer transitions 1/183 dead transitions. [2025-01-09 21:41:05,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 183 transitions, 693 flow [2025-01-09 21:41:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1548 transitions. [2025-01-09 21:41:05,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8472906403940886 [2025-01-09 21:41:05,162 INFO L175 Difference]: Start difference. First operand has 216 places, 186 transitions, 645 flow. Second operand 3 states and 1548 transitions. [2025-01-09 21:41:05,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 183 transitions, 693 flow [2025-01-09 21:41:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 183 transitions, 510 flow, removed 91 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:05,165 INFO L231 Difference]: Finished difference. Result has 216 places, 182 transitions, 458 flow [2025-01-09 21:41:05,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=216, PETRI_TRANSITIONS=182} [2025-01-09 21:41:05,166 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 0 predicate places. [2025-01-09 21:41:05,166 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 182 transitions, 458 flow [2025-01-09 21:41:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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:41:05,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 21:41:05,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 205692725, now seen corresponding path program 1 times [2025-01-09 21:41:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163690714] [2025-01-09 21:41:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:05,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:05,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,179 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:41:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163690714] [2025-01-09 21:41:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163690714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757655] [2025-01-09 21:41:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:05,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:05,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 609 [2025-01-09 21:41:05,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 182 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 475.0) internal successors, (1425), 3 states have internal predecessors, (1425), 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:41:05,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 609 [2025-01-09 21:41:05,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,296 INFO L124 PetriNetUnfolderBase]: 17/726 cut-off events. [2025-01-09 21:41:05,296 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-09 21:41:05,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 726 events. 17/726 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1582 event pairs, 0 based on Foata normal form. 16/709 useless extension candidates. Maximal degree in co-relation 872. Up to 85 conditions per place. [2025-01-09 21:41:05,299 INFO L140 encePairwiseOnDemand]: 603/609 looper letters, 23 selfloop transitions, 1 changer transitions 24/177 dead transitions. [2025-01-09 21:41:05,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 177 transitions, 500 flow [2025-01-09 21:41:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1453 transitions. [2025-01-09 21:41:05,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7952928297755884 [2025-01-09 21:41:05,301 INFO L175 Difference]: Start difference. First operand has 216 places, 182 transitions, 458 flow. Second operand 3 states and 1453 transitions. [2025-01-09 21:41:05,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 177 transitions, 500 flow [2025-01-09 21:41:05,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 177 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:05,302 INFO L231 Difference]: Finished difference. Result has 210 places, 153 transitions, 396 flow [2025-01-09 21:41:05,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=210, PETRI_TRANSITIONS=153} [2025-01-09 21:41:05,303 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -6 predicate places. [2025-01-09 21:41:05,303 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 153 transitions, 396 flow [2025-01-09 21:41:05,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.0) internal successors, (1425), 3 states have internal predecessors, (1425), 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:41:05,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,303 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-09 21:41:05,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:05,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 711123678, now seen corresponding path program 1 times [2025-01-09 21:41:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-01-09 21:41:05,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 21:41:05,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 21:41:05,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,356 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:41:05,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-01-09 21:41:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935887593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656942280] [2025-01-09 21:41:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:05,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:05,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 609 [2025-01-09 21:41:05,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 153 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 528.25) internal successors, (2113), 4 states have internal predecessors, (2113), 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:41:05,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 609 [2025-01-09 21:41:05,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,458 INFO L124 PetriNetUnfolderBase]: 0/341 cut-off events. [2025-01-09 21:41:05,458 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:41:05,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 341 events. 0/341 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 180 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2025-01-09 21:41:05,458 INFO L140 encePairwiseOnDemand]: 605/609 looper letters, 19 selfloop transitions, 3 changer transitions 0/152 dead transitions. [2025-01-09 21:41:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 152 transitions, 438 flow [2025-01-09 21:41:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2115 transitions. [2025-01-09 21:41:05,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682266009852216 [2025-01-09 21:41:05,460 INFO L175 Difference]: Start difference. First operand has 210 places, 153 transitions, 396 flow. Second operand 4 states and 2115 transitions. [2025-01-09 21:41:05,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 152 transitions, 438 flow [2025-01-09 21:41:05,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 152 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:05,462 INFO L231 Difference]: Finished difference. Result has 187 places, 152 transitions, 399 flow [2025-01-09 21:41:05,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=187, PETRI_TRANSITIONS=152} [2025-01-09 21:41:05,462 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, -29 predicate places. [2025-01-09 21:41:05,462 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 152 transitions, 399 flow [2025-01-09 21:41:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 528.25) internal successors, (2113), 4 states have internal predecessors, (2113), 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:41:05,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,463 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 21:41:05,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 655373103, now seen corresponding path program 1 times [2025-01-09 21:41:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201976244] [2025-01-09 21:41:05,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 21:41:05,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 21:41:05,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:05,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 21:41:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 21:41:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:05,529 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 23 remaining) [2025-01-09 21:41:05,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:41:05,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:41:05,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:41:05,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:41:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-09 21:41:05,532 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:05,532 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:05,532 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-01-09 21:41:05,636 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:05,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 660 places, 645 transitions, 1898 flow [2025-01-09 21:41:05,747 INFO L124 PetriNetUnfolderBase]: 70/1099 cut-off events. [2025-01-09 21:41:05,747 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2025-01-09 21:41:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 1099 events. 70/1099 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3035 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1285. Up to 34 conditions per place. [2025-01-09 21:41:05,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 660 places, 645 transitions, 1898 flow [2025-01-09 21:41:05,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 193 transitions, 693 flow [2025-01-09 21:41:05,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:05,754 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:05,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-09 21:41:05,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:05,755 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:05,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:05,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:05,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -858524148, now seen corresponding path program 1 times [2025-01-09 21:41:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392319497] [2025-01-09 21:41:05,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:05,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:05,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,771 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:41:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392319497] [2025-01-09 21:41:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392319497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816749331] [2025-01-09 21:41:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:05,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:05,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 645 [2025-01-09 21:41:05,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 193 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 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:41:05,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 645 [2025-01-09 21:41:05,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,996 INFO L124 PetriNetUnfolderBase]: 35/859 cut-off events. [2025-01-09 21:41:05,996 INFO L125 PetriNetUnfolderBase]: For 953/953 co-relation queries the response was YES. [2025-01-09 21:41:06,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 859 events. 35/859 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2177 event pairs, 17 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 1095. Up to 125 conditions per place. [2025-01-09 21:41:06,002 INFO L140 encePairwiseOnDemand]: 640/645 looper letters, 26 selfloop transitions, 2 changer transitions 1/190 dead transitions. [2025-01-09 21:41:06,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 190 transitions, 743 flow [2025-01-09 21:41:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:41:06,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470284237726098 [2025-01-09 21:41:06,004 INFO L175 Difference]: Start difference. First operand has 225 places, 193 transitions, 693 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:41:06,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 190 transitions, 743 flow [2025-01-09 21:41:06,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 190 transitions, 532 flow, removed 105 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:06,007 INFO L231 Difference]: Finished difference. Result has 225 places, 189 transitions, 478 flow [2025-01-09 21:41:06,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=645, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=225, PETRI_TRANSITIONS=189} [2025-01-09 21:41:06,008 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, 0 predicate places. [2025-01-09 21:41:06,008 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 189 transitions, 478 flow [2025-01-09 21:41:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 537.3333333333334) internal successors, (1612), 3 states have internal predecessors, (1612), 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:41:06,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-09 21:41:06,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash 243473594, now seen corresponding path program 1 times [2025-01-09 21:41:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285999444] [2025-01-09 21:41:06,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:06,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:06,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,029 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:41:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285999444] [2025-01-09 21:41:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285999444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103510098] [2025-01-09 21:41:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:06,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:06,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 645 [2025-01-09 21:41:06,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 189 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 503.0) internal successors, (1509), 3 states have internal predecessors, (1509), 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:41:06,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 645 [2025-01-09 21:41:06,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:06,182 INFO L124 PetriNetUnfolderBase]: 18/770 cut-off events. [2025-01-09 21:41:06,182 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-01-09 21:41:06,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 770 events. 18/770 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1617 event pairs, 0 based on Foata normal form. 17/752 useless extension candidates. Maximal degree in co-relation 926. Up to 90 conditions per place. [2025-01-09 21:41:06,186 INFO L140 encePairwiseOnDemand]: 639/645 looper letters, 24 selfloop transitions, 1 changer transitions 24/184 dead transitions. [2025-01-09 21:41:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 184 transitions, 522 flow [2025-01-09 21:41:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1538 transitions. [2025-01-09 21:41:06,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948320413436692 [2025-01-09 21:41:06,188 INFO L175 Difference]: Start difference. First operand has 225 places, 189 transitions, 478 flow. Second operand 3 states and 1538 transitions. [2025-01-09 21:41:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 184 transitions, 522 flow [2025-01-09 21:41:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 184 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:06,190 INFO L231 Difference]: Finished difference. Result has 219 places, 160 transitions, 416 flow [2025-01-09 21:41:06,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=645, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=219, PETRI_TRANSITIONS=160} [2025-01-09 21:41:06,190 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -6 predicate places. [2025-01-09 21:41:06,191 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 160 transitions, 416 flow [2025-01-09 21:41:06,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 503.0) internal successors, (1509), 3 states have internal predecessors, (1509), 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:41:06,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,191 INFO L206 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-01-09 21:41:06,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:06,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1108523428, now seen corresponding path program 1 times [2025-01-09 21:41:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-01-09 21:41:06,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 21:41:06,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 21:41:06,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,254 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:41:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-01-09 21:41:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072912484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33031389] [2025-01-09 21:41:06,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:06,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 645 [2025-01-09 21:41:06,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 160 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 559.5) internal successors, (2238), 4 states have internal predecessors, (2238), 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:41:06,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 645 [2025-01-09 21:41:06,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:06,361 INFO L124 PetriNetUnfolderBase]: 0/361 cut-off events. [2025-01-09 21:41:06,362 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-09 21:41:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 361 events. 0/361 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 192 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2025-01-09 21:41:06,363 INFO L140 encePairwiseOnDemand]: 641/645 looper letters, 20 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-01-09 21:41:06,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 159 transitions, 460 flow [2025-01-09 21:41:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2240 transitions. [2025-01-09 21:41:06,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682170542635659 [2025-01-09 21:41:06,365 INFO L175 Difference]: Start difference. First operand has 219 places, 160 transitions, 416 flow. Second operand 4 states and 2240 transitions. [2025-01-09 21:41:06,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 159 transitions, 460 flow [2025-01-09 21:41:06,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 159 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:06,367 INFO L231 Difference]: Finished difference. Result has 196 places, 159 transitions, 419 flow [2025-01-09 21:41:06,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=645, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=196, PETRI_TRANSITIONS=159} [2025-01-09 21:41:06,368 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -29 predicate places. [2025-01-09 21:41:06,368 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 159 transitions, 419 flow [2025-01-09 21:41:06,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 559.5) internal successors, (2238), 4 states have internal predecessors, (2238), 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:41:06,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,368 INFO L206 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-01-09 21:41:06,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 130128658, now seen corresponding path program 1 times [2025-01-09 21:41:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638014413] [2025-01-09 21:41:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 21:41:06,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 21:41:06,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:06,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:06,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 21:41:06,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 21:41:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:06,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:06,449 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:06,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-01-09 21:41:06,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2025-01-09 21:41:06,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-01-09 21:41:06,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-01-09 21:41:06,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-01-09 21:41:06,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-01-09 21:41:06,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-01-09 21:41:06,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-01-09 21:41:06,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-01-09 21:41:06,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-01-09 21:41:06,482 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:06,483 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:06,483 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-01-09 21:41:06,659 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:06,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 697 places, 681 transitions, 2042 flow [2025-01-09 21:41:06,789 INFO L124 PetriNetUnfolderBase]: 74/1162 cut-off events. [2025-01-09 21:41:06,789 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-01-09 21:41:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1162 events. 74/1162 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3264 event pairs, 0 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1368. Up to 36 conditions per place. [2025-01-09 21:41:06,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 697 places, 681 transitions, 2042 flow [2025-01-09 21:41:06,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 200 transitions, 743 flow [2025-01-09 21:41:06,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:06,799 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:06,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:41:06,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:06,800 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:06,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:06,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:06,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:06,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1426333204, now seen corresponding path program 1 times [2025-01-09 21:41:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946803622] [2025-01-09 21:41:06,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:06,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:06,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,823 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:41:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946803622] [2025-01-09 21:41:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946803622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949674791] [2025-01-09 21:41:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:06,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:06,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 681 [2025-01-09 21:41:06,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 200 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:41:06,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 681 [2025-01-09 21:41:06,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,037 INFO L124 PetriNetUnfolderBase]: 37/908 cut-off events. [2025-01-09 21:41:07,037 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2025-01-09 21:41:07,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 908 events. 37/908 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2321 event pairs, 18 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 1170. Up to 132 conditions per place. [2025-01-09 21:41:07,043 INFO L140 encePairwiseOnDemand]: 676/681 looper letters, 27 selfloop transitions, 2 changer transitions 1/197 dead transitions. [2025-01-09 21:41:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 197 transitions, 795 flow [2025-01-09 21:41:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1730 transitions. [2025-01-09 21:41:07,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846793930494371 [2025-01-09 21:41:07,046 INFO L175 Difference]: Start difference. First operand has 234 places, 200 transitions, 743 flow. Second operand 3 states and 1730 transitions. [2025-01-09 21:41:07,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 197 transitions, 795 flow [2025-01-09 21:41:07,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 197 transitions, 554 flow, removed 120 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,050 INFO L231 Difference]: Finished difference. Result has 234 places, 196 transitions, 498 flow [2025-01-09 21:41:07,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=681, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=234, PETRI_TRANSITIONS=196} [2025-01-09 21:41:07,051 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, 0 predicate places. [2025-01-09 21:41:07,051 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 196 transitions, 498 flow [2025-01-09 21:41:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:41:07,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:07,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-01-09 21:41:07,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:07,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1774225821, now seen corresponding path program 1 times [2025-01-09 21:41:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-01-09 21:41:07,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:07,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:07,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-01-09 21:41:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345542349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963084170] [2025-01-09 21:41:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:07,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 681 [2025-01-09 21:41:07,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 196 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 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:41:07,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 681 [2025-01-09 21:41:07,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,224 INFO L124 PetriNetUnfolderBase]: 19/814 cut-off events. [2025-01-09 21:41:07,225 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-01-09 21:41:07,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 814 events. 19/814 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1715 event pairs, 0 based on Foata normal form. 18/795 useless extension candidates. Maximal degree in co-relation 980. Up to 95 conditions per place. [2025-01-09 21:41:07,229 INFO L140 encePairwiseOnDemand]: 675/681 looper letters, 25 selfloop transitions, 1 changer transitions 24/191 dead transitions. [2025-01-09 21:41:07,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 191 transitions, 544 flow [2025-01-09 21:41:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1623 transitions. [2025-01-09 21:41:07,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944199706314243 [2025-01-09 21:41:07,231 INFO L175 Difference]: Start difference. First operand has 234 places, 196 transitions, 498 flow. Second operand 3 states and 1623 transitions. [2025-01-09 21:41:07,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 191 transitions, 544 flow [2025-01-09 21:41:07,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 191 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:07,234 INFO L231 Difference]: Finished difference. Result has 228 places, 167 transitions, 436 flow [2025-01-09 21:41:07,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=681, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=228, PETRI_TRANSITIONS=167} [2025-01-09 21:41:07,235 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -6 predicate places. [2025-01-09 21:41:07,235 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 167 transitions, 436 flow [2025-01-09 21:41:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 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:41:07,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,235 INFO L206 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-01-09 21:41:07,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:07,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1925673057, now seen corresponding path program 1 times [2025-01-09 21:41:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387224056] [2025-01-09 21:41:07,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 21:41:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 21:41:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,296 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:41:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387224056] [2025-01-09 21:41:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387224056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487537672] [2025-01-09 21:41:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:07,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:07,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:07,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 681 [2025-01-09 21:41:07,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 167 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 590.75) internal successors, (2363), 4 states have internal predecessors, (2363), 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:41:07,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 681 [2025-01-09 21:41:07,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,395 INFO L124 PetriNetUnfolderBase]: 0/381 cut-off events. [2025-01-09 21:41:07,396 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-09 21:41:07,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 381 events. 0/381 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 203 event pairs, 0 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2025-01-09 21:41:07,396 INFO L140 encePairwiseOnDemand]: 677/681 looper letters, 21 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2025-01-09 21:41:07,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 166 transitions, 482 flow [2025-01-09 21:41:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2365 transitions. [2025-01-09 21:41:07,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868208516886931 [2025-01-09 21:41:07,397 INFO L175 Difference]: Start difference. First operand has 228 places, 167 transitions, 436 flow. Second operand 4 states and 2365 transitions. [2025-01-09 21:41:07,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 166 transitions, 482 flow [2025-01-09 21:41:07,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 166 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,399 INFO L231 Difference]: Finished difference. Result has 205 places, 166 transitions, 439 flow [2025-01-09 21:41:07,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=681, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=205, PETRI_TRANSITIONS=166} [2025-01-09 21:41:07,400 INFO L279 CegarLoopForPetriNet]: 234 programPoint places, -29 predicate places. [2025-01-09 21:41:07,400 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 166 transitions, 439 flow [2025-01-09 21:41:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 590.75) internal successors, (2363), 4 states have internal predecessors, (2363), 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:41:07,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,400 INFO L206 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-01-09 21:41:07,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:07,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1964401056, now seen corresponding path program 1 times [2025-01-09 21:41:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007723269] [2025-01-09 21:41:07,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 21:41:07,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 21:41:07,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:07,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:07,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 21:41:07,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 21:41:07,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:07,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:07,463 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:07,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-01-09 21:41:07,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-01-09 21:41:07,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-01-09 21:41:07,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-01-09 21:41:07,464 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:07,464 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:07,464 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-01-09 21:41:07,533 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:07,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 734 places, 717 transitions, 2190 flow [2025-01-09 21:41:07,659 INFO L124 PetriNetUnfolderBase]: 78/1225 cut-off events. [2025-01-09 21:41:07,659 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2025-01-09 21:41:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 1225 events. 78/1225 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3555 event pairs, 0 based on Foata normal form. 0/1086 useless extension candidates. Maximal degree in co-relation 1452. Up to 38 conditions per place. [2025-01-09 21:41:07,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 734 places, 717 transitions, 2190 flow [2025-01-09 21:41:07,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 207 transitions, 795 flow [2025-01-09 21:41:07,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:07,669 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:07,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:41:07,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:07,670 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:07,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:07,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:07,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1532906828, now seen corresponding path program 1 times [2025-01-09 21:41:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085318960] [2025-01-09 21:41:07,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:07,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:07,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,683 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:41:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085318960] [2025-01-09 21:41:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085318960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604876236] [2025-01-09 21:41:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:07,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 717 [2025-01-09 21:41:07,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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:41:07,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 717 [2025-01-09 21:41:07,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,846 INFO L124 PetriNetUnfolderBase]: 39/957 cut-off events. [2025-01-09 21:41:07,846 INFO L125 PetriNetUnfolderBase]: For 1312/1312 co-relation queries the response was YES. [2025-01-09 21:41:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 957 events. 39/957 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2448 event pairs, 19 based on Foata normal form. 1/877 useless extension candidates. Maximal degree in co-relation 1246. Up to 139 conditions per place. [2025-01-09 21:41:07,852 INFO L140 encePairwiseOnDemand]: 712/717 looper letters, 28 selfloop transitions, 2 changer transitions 1/204 dead transitions. [2025-01-09 21:41:07,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 204 transitions, 849 flow [2025-01-09 21:41:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2025-01-09 21:41:07,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8465829846582985 [2025-01-09 21:41:07,853 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 795 flow. Second operand 3 states and 1821 transitions. [2025-01-09 21:41:07,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 204 transitions, 849 flow [2025-01-09 21:41:07,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 204 transitions, 576 flow, removed 136 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,857 INFO L231 Difference]: Finished difference. Result has 243 places, 203 transitions, 518 flow [2025-01-09 21:41:07,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=243, PETRI_TRANSITIONS=203} [2025-01-09 21:41:07,857 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 0 predicate places. [2025-01-09 21:41:07,858 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 203 transitions, 518 flow [2025-01-09 21:41:07,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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:41:07,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-01-09 21:41:07,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1552438224, now seen corresponding path program 1 times [2025-01-09 21:41:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680923536] [2025-01-09 21:41:07,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:07,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:07,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,871 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:41:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680923536] [2025-01-09 21:41:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680923536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430489997] [2025-01-09 21:41:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:07,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 717 [2025-01-09 21:41:07,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 203 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 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:41:07,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 717 [2025-01-09 21:41:07,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,011 INFO L124 PetriNetUnfolderBase]: 20/858 cut-off events. [2025-01-09 21:41:08,011 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-09 21:41:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 858 events. 20/858 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1814 event pairs, 0 based on Foata normal form. 19/838 useless extension candidates. Maximal degree in co-relation 1034. Up to 100 conditions per place. [2025-01-09 21:41:08,015 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 26 selfloop transitions, 1 changer transitions 24/198 dead transitions. [2025-01-09 21:41:08,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 198 transitions, 566 flow [2025-01-09 21:41:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-01-09 21:41:08,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794049279404928 [2025-01-09 21:41:08,016 INFO L175 Difference]: Start difference. First operand has 243 places, 203 transitions, 518 flow. Second operand 3 states and 1708 transitions. [2025-01-09 21:41:08,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 198 transitions, 566 flow [2025-01-09 21:41:08,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 198 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:08,018 INFO L231 Difference]: Finished difference. Result has 237 places, 174 transitions, 456 flow [2025-01-09 21:41:08,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=237, PETRI_TRANSITIONS=174} [2025-01-09 21:41:08,019 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-01-09 21:41:08,019 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 174 transitions, 456 flow [2025-01-09 21:41:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 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:41:08,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,020 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-01-09 21:41:08,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -337218067, now seen corresponding path program 1 times [2025-01-09 21:41:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-01-09 21:41:08,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 21:41:08,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 21:41:08,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,073 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:41:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-01-09 21:41:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016519026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607863842] [2025-01-09 21:41:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:08,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:08,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 717 [2025-01-09 21:41:08,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 174 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 622.0) internal successors, (2488), 4 states have internal predecessors, (2488), 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:41:08,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 717 [2025-01-09 21:41:08,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,189 INFO L124 PetriNetUnfolderBase]: 0/401 cut-off events. [2025-01-09 21:41:08,189 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-01-09 21:41:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 401 events. 0/401 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 215 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2025-01-09 21:41:08,189 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 22 selfloop transitions, 3 changer transitions 0/173 dead transitions. [2025-01-09 21:41:08,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 173 transitions, 504 flow [2025-01-09 21:41:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2490 transitions. [2025-01-09 21:41:08,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682008368200836 [2025-01-09 21:41:08,190 INFO L175 Difference]: Start difference. First operand has 237 places, 174 transitions, 456 flow. Second operand 4 states and 2490 transitions. [2025-01-09 21:41:08,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 173 transitions, 504 flow [2025-01-09 21:41:08,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 173 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:08,193 INFO L231 Difference]: Finished difference. Result has 214 places, 173 transitions, 459 flow [2025-01-09 21:41:08,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=214, PETRI_TRANSITIONS=173} [2025-01-09 21:41:08,193 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -29 predicate places. [2025-01-09 21:41:08,193 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 173 transitions, 459 flow [2025-01-09 21:41:08,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 622.0) internal successors, (2488), 4 states have internal predecessors, (2488), 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:41:08,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,194 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-01-09 21:41:08,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:08,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1722777895, now seen corresponding path program 1 times [2025-01-09 21:41:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335344160] [2025-01-09 21:41:08,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:41:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:41:08,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:08,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:41:08,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:41:08,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:08,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:08,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:08,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-01-09 21:41:08,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-01-09 21:41:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-01-09 21:41:08,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-01-09 21:41:08,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-01-09 21:41:08,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:08,258 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:08,259 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-01-09 21:41:08,348 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:08,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 771 places, 753 transitions, 2342 flow [2025-01-09 21:41:08,480 INFO L124 PetriNetUnfolderBase]: 82/1288 cut-off events. [2025-01-09 21:41:08,481 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2025-01-09 21:41:08,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1288 events. 82/1288 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3778 event pairs, 0 based on Foata normal form. 0/1142 useless extension candidates. Maximal degree in co-relation 1537. Up to 40 conditions per place. [2025-01-09 21:41:08,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 771 places, 753 transitions, 2342 flow [2025-01-09 21:41:08,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 214 transitions, 849 flow [2025-01-09 21:41:08,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:08,491 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:08,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:41:08,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:08,492 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:08,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:08,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:08,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:08,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -570738644, now seen corresponding path program 1 times [2025-01-09 21:41:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769638686] [2025-01-09 21:41:08,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:08,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:08,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,506 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:41:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769638686] [2025-01-09 21:41:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769638686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493978939] [2025-01-09 21:41:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:08,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:08,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 753 [2025-01-09 21:41:08,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 214 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:41:08,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 753 [2025-01-09 21:41:08,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,692 INFO L124 PetriNetUnfolderBase]: 41/1006 cut-off events. [2025-01-09 21:41:08,693 INFO L125 PetriNetUnfolderBase]: For 1521/1521 co-relation queries the response was YES. [2025-01-09 21:41:08,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1006 events. 41/1006 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2678 event pairs, 20 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1323. Up to 146 conditions per place. [2025-01-09 21:41:08,700 INFO L140 encePairwiseOnDemand]: 748/753 looper letters, 29 selfloop transitions, 2 changer transitions 1/211 dead transitions. [2025-01-09 21:41:08,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 211 transitions, 905 flow [2025-01-09 21:41:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1912 transitions. [2025-01-09 21:41:08,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463922089420097 [2025-01-09 21:41:08,702 INFO L175 Difference]: Start difference. First operand has 252 places, 214 transitions, 849 flow. Second operand 3 states and 1912 transitions. [2025-01-09 21:41:08,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 211 transitions, 905 flow [2025-01-09 21:41:08,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 211 transitions, 598 flow, removed 153 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:08,706 INFO L231 Difference]: Finished difference. Result has 252 places, 210 transitions, 538 flow [2025-01-09 21:41:08,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=753, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=252, PETRI_TRANSITIONS=210} [2025-01-09 21:41:08,707 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 0 predicate places. [2025-01-09 21:41:08,707 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 210 transitions, 538 flow [2025-01-09 21:41:08,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:41:08,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-01-09 21:41:08,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 908836385, now seen corresponding path program 1 times [2025-01-09 21:41:08,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178919463] [2025-01-09 21:41:08,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178919463] [2025-01-09 21:41:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178919463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645259712] [2025-01-09 21:41:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:08,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:08,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 753 [2025-01-09 21:41:08,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 210 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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:41:08,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 753 [2025-01-09 21:41:08,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,878 INFO L124 PetriNetUnfolderBase]: 21/902 cut-off events. [2025-01-09 21:41:08,878 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-01-09 21:41:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 902 events. 21/902 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1973 event pairs, 0 based on Foata normal form. 20/881 useless extension candidates. Maximal degree in co-relation 1088. Up to 105 conditions per place. [2025-01-09 21:41:08,883 INFO L140 encePairwiseOnDemand]: 747/753 looper letters, 27 selfloop transitions, 1 changer transitions 24/205 dead transitions. [2025-01-09 21:41:08,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 205 transitions, 588 flow [2025-01-09 21:41:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-01-09 21:41:08,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7937140327578575 [2025-01-09 21:41:08,884 INFO L175 Difference]: Start difference. First operand has 252 places, 210 transitions, 538 flow. Second operand 3 states and 1793 transitions. [2025-01-09 21:41:08,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 205 transitions, 588 flow [2025-01-09 21:41:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 205 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:08,887 INFO L231 Difference]: Finished difference. Result has 246 places, 181 transitions, 476 flow [2025-01-09 21:41:08,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=753, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=246, PETRI_TRANSITIONS=181} [2025-01-09 21:41:08,888 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-01-09 21:41:08,888 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 181 transitions, 476 flow [2025-01-09 21:41:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 587.0) internal successors, (1761), 3 states have internal predecessors, (1761), 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:41:08,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,888 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-01-09 21:41:08,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1978039296, now seen corresponding path program 1 times [2025-01-09 21:41:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886832814] [2025-01-09 21:41:08,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 21:41:08,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 21:41:08,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,950 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:41:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886832814] [2025-01-09 21:41:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886832814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088286307] [2025-01-09 21:41:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:08,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:09,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 647 out of 753 [2025-01-09 21:41:09,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 181 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 653.25) internal successors, (2613), 4 states have internal predecessors, (2613), 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:41:09,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 647 of 753 [2025-01-09 21:41:09,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,065 INFO L124 PetriNetUnfolderBase]: 0/421 cut-off events. [2025-01-09 21:41:09,065 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-01-09 21:41:09,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 421 events. 0/421 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 227 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 0. Up to 22 conditions per place. [2025-01-09 21:41:09,065 INFO L140 encePairwiseOnDemand]: 749/753 looper letters, 23 selfloop transitions, 3 changer transitions 0/180 dead transitions. [2025-01-09 21:41:09,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 180 transitions, 526 flow [2025-01-09 21:41:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2615 transitions. [2025-01-09 21:41:09,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681938911022576 [2025-01-09 21:41:09,067 INFO L175 Difference]: Start difference. First operand has 246 places, 181 transitions, 476 flow. Second operand 4 states and 2615 transitions. [2025-01-09 21:41:09,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 180 transitions, 526 flow [2025-01-09 21:41:09,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 180 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:09,069 INFO L231 Difference]: Finished difference. Result has 223 places, 180 transitions, 479 flow [2025-01-09 21:41:09,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=753, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=479, PETRI_PLACES=223, PETRI_TRANSITIONS=180} [2025-01-09 21:41:09,071 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -29 predicate places. [2025-01-09 21:41:09,071 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 180 transitions, 479 flow [2025-01-09 21:41:09,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 653.25) internal successors, (2613), 4 states have internal predecessors, (2613), 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:41:09,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,071 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:09,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-01-09 21:41:09,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:09,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2111732413, now seen corresponding path program 1 times [2025-01-09 21:41:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570965299] [2025-01-09 21:41:09,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:41:09,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:41:09,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:09,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:09,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:41:09,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:41:09,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:09,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:09,185 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-01-09 21:41:09,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-01-09 21:41:09,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-01-09 21:41:09,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-01-09 21:41:09,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-01-09 21:41:09,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-01-09 21:41:09,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-01-09 21:41:09,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-01-09 21:41:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-01-09 21:41:09,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:09,188 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:09,188 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-01-09 21:41:09,261 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 808 places, 789 transitions, 2498 flow [2025-01-09 21:41:09,374 INFO L124 PetriNetUnfolderBase]: 86/1351 cut-off events. [2025-01-09 21:41:09,375 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2025-01-09 21:41:09,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 1351 events. 86/1351 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3976 event pairs, 0 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1623. Up to 42 conditions per place. [2025-01-09 21:41:09,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 808 places, 789 transitions, 2498 flow [2025-01-09 21:41:09,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 221 transitions, 905 flow [2025-01-09 21:41:09,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:09,387 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:09,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:41:09,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:09,388 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:09,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:09,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:09,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:09,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash 852664972, now seen corresponding path program 1 times [2025-01-09 21:41:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255445504] [2025-01-09 21:41:09,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,404 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:41:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255445504] [2025-01-09 21:41:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255445504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264709267] [2025-01-09 21:41:09,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:09,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:09,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 789 [2025-01-09 21:41:09,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 221 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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:41:09,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 789 [2025-01-09 21:41:09,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,611 INFO L124 PetriNetUnfolderBase]: 43/1055 cut-off events. [2025-01-09 21:41:09,611 INFO L125 PetriNetUnfolderBase]: For 1751/1751 co-relation queries the response was YES. [2025-01-09 21:41:09,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 1055 events. 43/1055 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2716 event pairs, 21 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 1401. Up to 153 conditions per place. [2025-01-09 21:41:09,618 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 30 selfloop transitions, 2 changer transitions 1/218 dead transitions. [2025-01-09 21:41:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 218 transitions, 963 flow [2025-01-09 21:41:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2025-01-09 21:41:09,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462188424165611 [2025-01-09 21:41:09,620 INFO L175 Difference]: Start difference. First operand has 261 places, 221 transitions, 905 flow. Second operand 3 states and 2003 transitions. [2025-01-09 21:41:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 218 transitions, 963 flow [2025-01-09 21:41:09,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 218 transitions, 620 flow, removed 171 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:09,624 INFO L231 Difference]: Finished difference. Result has 261 places, 217 transitions, 558 flow [2025-01-09 21:41:09,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=261, PETRI_TRANSITIONS=217} [2025-01-09 21:41:09,626 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, 0 predicate places. [2025-01-09 21:41:09,626 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 217 transitions, 558 flow [2025-01-09 21:41:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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:41:09,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:09,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-01-09 21:41:09,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1314630710, now seen corresponding path program 1 times [2025-01-09 21:41:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376747316] [2025-01-09 21:41:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:09,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:09,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,643 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:41:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376747316] [2025-01-09 21:41:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376747316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744375311] [2025-01-09 21:41:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:09,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 789 [2025-01-09 21:41:09,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 217 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 615.0) internal successors, (1845), 3 states have internal predecessors, (1845), 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:41:09,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 789 [2025-01-09 21:41:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,804 INFO L124 PetriNetUnfolderBase]: 22/946 cut-off events. [2025-01-09 21:41:09,804 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-01-09 21:41:09,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 946 events. 22/946 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2012 event pairs, 0 based on Foata normal form. 21/924 useless extension candidates. Maximal degree in co-relation 1142. Up to 110 conditions per place. [2025-01-09 21:41:09,810 INFO L140 encePairwiseOnDemand]: 783/789 looper letters, 28 selfloop transitions, 1 changer transitions 24/212 dead transitions. [2025-01-09 21:41:09,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 212 transitions, 610 flow [2025-01-09 21:41:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1878 transitions. [2025-01-09 21:41:09,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7934093789607097 [2025-01-09 21:41:09,811 INFO L175 Difference]: Start difference. First operand has 261 places, 217 transitions, 558 flow. Second operand 3 states and 1878 transitions. [2025-01-09 21:41:09,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 212 transitions, 610 flow [2025-01-09 21:41:09,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 212 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:09,814 INFO L231 Difference]: Finished difference. Result has 255 places, 188 transitions, 496 flow [2025-01-09 21:41:09,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=255, PETRI_TRANSITIONS=188} [2025-01-09 21:41:09,814 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -6 predicate places. [2025-01-09 21:41:09,814 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 188 transitions, 496 flow [2025-01-09 21:41:09,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.0) internal successors, (1845), 3 states have internal predecessors, (1845), 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:41:09,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,815 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-01-09 21:41:09,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1527072870, now seen corresponding path program 1 times [2025-01-09 21:41:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035219298] [2025-01-09 21:41:09,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 21:41:09,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 21:41:09,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,875 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:41:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035219298] [2025-01-09 21:41:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035219298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796493289] [2025-01-09 21:41:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:09,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:09,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 678 out of 789 [2025-01-09 21:41:09,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 188 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 684.5) internal successors, (2738), 4 states have internal predecessors, (2738), 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:41:09,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 678 of 789 [2025-01-09 21:41:09,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,067 INFO L124 PetriNetUnfolderBase]: 0/441 cut-off events. [2025-01-09 21:41:10,067 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-01-09 21:41:10,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 441 events. 0/441 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 239 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 0. Up to 23 conditions per place. [2025-01-09 21:41:10,068 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 24 selfloop transitions, 3 changer transitions 0/187 dead transitions. [2025-01-09 21:41:10,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 187 transitions, 548 flow [2025-01-09 21:41:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2740 transitions. [2025-01-09 21:41:10,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681875792141952 [2025-01-09 21:41:10,070 INFO L175 Difference]: Start difference. First operand has 255 places, 188 transitions, 496 flow. Second operand 4 states and 2740 transitions. [2025-01-09 21:41:10,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 187 transitions, 548 flow [2025-01-09 21:41:10,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 187 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:10,073 INFO L231 Difference]: Finished difference. Result has 232 places, 187 transitions, 499 flow [2025-01-09 21:41:10,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=232, PETRI_TRANSITIONS=187} [2025-01-09 21:41:10,073 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -29 predicate places. [2025-01-09 21:41:10,073 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 187 transitions, 499 flow [2025-01-09 21:41:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 684.5) internal successors, (2738), 4 states have internal predecessors, (2738), 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:41:10,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,074 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-01-09 21:41:10,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash -823431860, now seen corresponding path program 1 times [2025-01-09 21:41:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525381909] [2025-01-09 21:41:10,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 21:41:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 21:41:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:10,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:10,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 21:41:10,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 21:41:10,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:10,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:10,176 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:10,176 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2025-01-09 21:41:10,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-01-09 21:41:10,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-01-09 21:41:10,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-01-09 21:41:10,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-01-09 21:41:10,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-01-09 21:41:10,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-01-09 21:41:10,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-01-09 21:41:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-01-09 21:41:10,179 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:10,179 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:10,179 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-01-09 21:41:10,266 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:10,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 845 places, 825 transitions, 2658 flow [2025-01-09 21:41:10,464 INFO L124 PetriNetUnfolderBase]: 90/1414 cut-off events. [2025-01-09 21:41:10,464 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2025-01-09 21:41:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1414 events. 90/1414 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4102 event pairs, 0 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1710. Up to 44 conditions per place. [2025-01-09 21:41:10,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 845 places, 825 transitions, 2658 flow [2025-01-09 21:41:10,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 228 transitions, 963 flow [2025-01-09 21:41:10,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:10,478 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:10,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:41:10,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:10,479 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:10,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:10,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:10,479 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:41:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1508150380, now seen corresponding path program 1 times [2025-01-09 21:41:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177119834] [2025-01-09 21:41:10,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:10,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:10,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:10,501 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:41:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177119834] [2025-01-09 21:41:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177119834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360167236] [2025-01-09 21:41:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:10,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:10,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:10,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:10,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 825 [2025-01-09 21:41:10,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 228 transitions, 963 flow. Second operand has 3 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 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:41:10,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:10,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 825 [2025-01-09 21:41:10,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,732 INFO L124 PetriNetUnfolderBase]: 45/1104 cut-off events. [2025-01-09 21:41:10,732 INFO L125 PetriNetUnfolderBase]: For 2003/2003 co-relation queries the response was YES. [2025-01-09 21:41:10,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 1104 events. 45/1104 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2970 event pairs, 22 based on Foata normal form. 1/1012 useless extension candidates. Maximal degree in co-relation 1480. Up to 160 conditions per place. [2025-01-09 21:41:10,740 INFO L140 encePairwiseOnDemand]: 820/825 looper letters, 31 selfloop transitions, 2 changer transitions 1/225 dead transitions. [2025-01-09 21:41:10,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 225 transitions, 1023 flow [2025-01-09 21:41:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2094 transitions. [2025-01-09 21:41:10,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8460606060606061 [2025-01-09 21:41:10,741 INFO L175 Difference]: Start difference. First operand has 270 places, 228 transitions, 963 flow. Second operand 3 states and 2094 transitions. [2025-01-09 21:41:10,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 225 transitions, 1023 flow [2025-01-09 21:41:10,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 225 transitions, 642 flow, removed 190 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:10,746 INFO L231 Difference]: Finished difference. Result has 270 places, 224 transitions, 578 flow [2025-01-09 21:41:10,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=825, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=270, PETRI_TRANSITIONS=224} [2025-01-09 21:41:10,747 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, 0 predicate places. [2025-01-09 21:41:10,747 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 224 transitions, 578 flow [2025-01-09 21:41:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 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:41:10,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:10,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-01-09 21:41:10,747 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:41:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -335055249, now seen corresponding path program 1 times [2025-01-09 21:41:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87457875] [2025-01-09 21:41:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:10,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:41:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87457875] [2025-01-09 21:41:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87457875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:10,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989791311] [2025-01-09 21:41:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:10,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:10,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:10,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:10,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 642 out of 825 [2025-01-09 21:41:10,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 224 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 643.0) internal successors, (1929), 3 states have internal predecessors, (1929), 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:41:10,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:10,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 642 of 825 [2025-01-09 21:41:10,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,938 INFO L124 PetriNetUnfolderBase]: 23/990 cut-off events. [2025-01-09 21:41:10,938 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-01-09 21:41:10,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 990 events. 23/990 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2178 event pairs, 0 based on Foata normal form. 22/967 useless extension candidates. Maximal degree in co-relation 1196. Up to 115 conditions per place. [2025-01-09 21:41:10,944 INFO L140 encePairwiseOnDemand]: 819/825 looper letters, 29 selfloop transitions, 1 changer transitions 24/219 dead transitions. [2025-01-09 21:41:10,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 219 transitions, 632 flow [2025-01-09 21:41:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1963 transitions. [2025-01-09 21:41:10,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931313131313131 [2025-01-09 21:41:10,946 INFO L175 Difference]: Start difference. First operand has 270 places, 224 transitions, 578 flow. Second operand 3 states and 1963 transitions. [2025-01-09 21:41:10,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 219 transitions, 632 flow [2025-01-09 21:41:10,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 219 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:10,948 INFO L231 Difference]: Finished difference. Result has 264 places, 195 transitions, 516 flow [2025-01-09 21:41:10,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=825, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=264, PETRI_TRANSITIONS=195} [2025-01-09 21:41:10,949 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -6 predicate places. [2025-01-09 21:41:10,949 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 195 transitions, 516 flow [2025-01-09 21:41:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 643.0) internal successors, (1929), 3 states have internal predecessors, (1929), 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:41:10,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,950 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:10,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-01-09 21:41:10,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:41:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 937258427, now seen corresponding path program 1 times [2025-01-09 21:41:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539842643] [2025-01-09 21:41:10,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 21:41:10,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 21:41:10,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,012 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:41:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539842643] [2025-01-09 21:41:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539842643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681125002] [2025-01-09 21:41:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:11,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:11,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 825 [2025-01-09 21:41:11,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 195 transitions, 516 flow. Second operand has 4 states, 4 states have (on average 715.75) internal successors, (2863), 4 states have internal predecessors, (2863), 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:41:11,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 825 [2025-01-09 21:41:11,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,146 INFO L124 PetriNetUnfolderBase]: 0/461 cut-off events. [2025-01-09 21:41:11,147 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-09 21:41:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 461 events. 0/461 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 252 event pairs, 0 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 0. Up to 24 conditions per place. [2025-01-09 21:41:11,147 INFO L140 encePairwiseOnDemand]: 821/825 looper letters, 25 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2025-01-09 21:41:11,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 194 transitions, 570 flow [2025-01-09 21:41:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2865 transitions. [2025-01-09 21:41:11,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681818181818182 [2025-01-09 21:41:11,149 INFO L175 Difference]: Start difference. First operand has 264 places, 195 transitions, 516 flow. Second operand 4 states and 2865 transitions. [2025-01-09 21:41:11,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 194 transitions, 570 flow [2025-01-09 21:41:11,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 194 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:11,151 INFO L231 Difference]: Finished difference. Result has 241 places, 194 transitions, 519 flow [2025-01-09 21:41:11,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=825, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=241, PETRI_TRANSITIONS=194} [2025-01-09 21:41:11,152 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -29 predicate places. [2025-01-09 21:41:11,152 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 194 transitions, 519 flow [2025-01-09 21:41:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 715.75) internal successors, (2863), 4 states have internal predecessors, (2863), 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:41:11,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,152 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-01-09 21:41:11,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:41:11,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2146369158, now seen corresponding path program 1 times [2025-01-09 21:41:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537423169] [2025-01-09 21:41:11,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 21:41:11,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 21:41:11,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:11,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:11,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 21:41:11,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 21:41:11,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:11,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:11,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-01-09 21:41:11,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-01-09 21:41:11,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-01-09 21:41:11,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-01-09 21:41:11,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-01-09 21:41:11,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:11,271 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:11,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-01-09 21:41:11,379 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 882 places, 861 transitions, 2822 flow [2025-01-09 21:41:11,517 INFO L124 PetriNetUnfolderBase]: 94/1477 cut-off events. [2025-01-09 21:41:11,518 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2025-01-09 21:41:11,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1477 events. 94/1477 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4203 event pairs, 0 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1798. Up to 46 conditions per place. [2025-01-09 21:41:11,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 882 places, 861 transitions, 2822 flow [2025-01-09 21:41:11,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 235 transitions, 1023 flow [2025-01-09 21:41:11,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:11,533 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:11,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 21:41:11,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:11,534 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:11,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:11,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:11,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:11,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1395717580, now seen corresponding path program 1 times [2025-01-09 21:41:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848650631] [2025-01-09 21:41:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:11,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:11,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,554 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:41:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848650631] [2025-01-09 21:41:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848650631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642665368] [2025-01-09 21:41:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:11,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 861 [2025-01-09 21:41:11,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 235 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 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:41:11,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 861 [2025-01-09 21:41:11,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,780 INFO L124 PetriNetUnfolderBase]: 47/1153 cut-off events. [2025-01-09 21:41:11,780 INFO L125 PetriNetUnfolderBase]: For 2278/2278 co-relation queries the response was YES. [2025-01-09 21:41:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1153 events. 47/1153 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2972 event pairs, 23 based on Foata normal form. 1/1057 useless extension candidates. Maximal degree in co-relation 1560. Up to 167 conditions per place. [2025-01-09 21:41:11,790 INFO L140 encePairwiseOnDemand]: 856/861 looper letters, 32 selfloop transitions, 2 changer transitions 1/232 dead transitions. [2025-01-09 21:41:11,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 232 transitions, 1085 flow [2025-01-09 21:41:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2185 transitions. [2025-01-09 21:41:11,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845915602013163 [2025-01-09 21:41:11,791 INFO L175 Difference]: Start difference. First operand has 279 places, 235 transitions, 1023 flow. Second operand 3 states and 2185 transitions. [2025-01-09 21:41:11,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 232 transitions, 1085 flow [2025-01-09 21:41:11,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 232 transitions, 664 flow, removed 210 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:11,795 INFO L231 Difference]: Finished difference. Result has 279 places, 231 transitions, 598 flow [2025-01-09 21:41:11,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=277, 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=598, PETRI_PLACES=279, PETRI_TRANSITIONS=231} [2025-01-09 21:41:11,797 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 0 predicate places. [2025-01-09 21:41:11,797 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 231 transitions, 598 flow [2025-01-09 21:41:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 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:41:11,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-01-09 21:41:11,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash 254745804, now seen corresponding path program 1 times [2025-01-09 21:41:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804742764] [2025-01-09 21:41:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,818 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:41:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804742764] [2025-01-09 21:41:11,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804742764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460456853] [2025-01-09 21:41:11,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:11,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:11,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:11,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 861 [2025-01-09 21:41:11,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 231 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 671.0) internal successors, (2013), 3 states have internal predecessors, (2013), 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:41:11,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 861 [2025-01-09 21:41:11,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,997 INFO L124 PetriNetUnfolderBase]: 24/1034 cut-off events. [2025-01-09 21:41:11,998 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-01-09 21:41:12,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1034 events. 24/1034 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2210 event pairs, 0 based on Foata normal form. 23/1010 useless extension candidates. Maximal degree in co-relation 1250. Up to 120 conditions per place. [2025-01-09 21:41:12,004 INFO L140 encePairwiseOnDemand]: 855/861 looper letters, 30 selfloop transitions, 1 changer transitions 24/226 dead transitions. [2025-01-09 21:41:12,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 226 transitions, 654 flow [2025-01-09 21:41:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2048 transitions. [2025-01-09 21:41:12,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928765001935734 [2025-01-09 21:41:12,006 INFO L175 Difference]: Start difference. First operand has 279 places, 231 transitions, 598 flow. Second operand 3 states and 2048 transitions. [2025-01-09 21:41:12,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 226 transitions, 654 flow [2025-01-09 21:41:12,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 226 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:12,008 INFO L231 Difference]: Finished difference. Result has 273 places, 202 transitions, 536 flow [2025-01-09 21:41:12,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=273, PETRI_TRANSITIONS=202} [2025-01-09 21:41:12,008 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-01-09 21:41:12,008 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 202 transitions, 536 flow [2025-01-09 21:41:12,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.0) internal successors, (2013), 3 states have internal predecessors, (2013), 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:41:12,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,009 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-01-09 21:41:12,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:12,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1069544291, now seen corresponding path program 1 times [2025-01-09 21:41:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369830163] [2025-01-09 21:41:12,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 21:41:12,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 21:41:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,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:41:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369830163] [2025-01-09 21:41:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369830163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936862795] [2025-01-09 21:41:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:12,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 861 [2025-01-09 21:41:12,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 202 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 747.0) internal successors, (2988), 4 states have internal predecessors, (2988), 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:41:12,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 861 [2025-01-09 21:41:12,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:12,204 INFO L124 PetriNetUnfolderBase]: 0/481 cut-off events. [2025-01-09 21:41:12,204 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-01-09 21:41:12,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 481 events. 0/481 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 263 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 0. Up to 25 conditions per place. [2025-01-09 21:41:12,205 INFO L140 encePairwiseOnDemand]: 857/861 looper letters, 26 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2025-01-09 21:41:12,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 201 transitions, 592 flow [2025-01-09 21:41:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2990 transitions. [2025-01-09 21:41:12,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681765389082462 [2025-01-09 21:41:12,207 INFO L175 Difference]: Start difference. First operand has 273 places, 202 transitions, 536 flow. Second operand 4 states and 2990 transitions. [2025-01-09 21:41:12,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 201 transitions, 592 flow [2025-01-09 21:41:12,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 201 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:12,209 INFO L231 Difference]: Finished difference. Result has 250 places, 201 transitions, 539 flow [2025-01-09 21:41:12,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=250, PETRI_TRANSITIONS=201} [2025-01-09 21:41:12,210 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -29 predicate places. [2025-01-09 21:41:12,210 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 201 transitions, 539 flow [2025-01-09 21:41:12,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.0) internal successors, (2988), 4 states have internal predecessors, (2988), 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:41:12,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,210 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:12,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-01-09 21:41:12,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1362978411, now seen corresponding path program 1 times [2025-01-09 21:41:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936510981] [2025-01-09 21:41:12,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 21:41:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 21:41:12,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:12,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:12,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 21:41:12,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 21:41:12,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:12,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:12,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:12,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-01-09 21:41:12,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-01-09 21:41:12,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-01-09 21:41:12,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-01-09 21:41:12,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-01-09 21:41:12,332 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:12,333 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:12,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-01-09 21:41:12,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:12,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 919 places, 897 transitions, 2990 flow [2025-01-09 21:41:12,553 INFO L124 PetriNetUnfolderBase]: 98/1540 cut-off events. [2025-01-09 21:41:12,553 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2025-01-09 21:41:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1540 events. 98/1540 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4366 event pairs, 0 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 1887. Up to 48 conditions per place. [2025-01-09 21:41:12,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 919 places, 897 transitions, 2990 flow [2025-01-09 21:41:12,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 242 transitions, 1085 flow [2025-01-09 21:41:12,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:12,569 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:12,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:41:12,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:12,570 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:12,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:12,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:12,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:12,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 515366572, now seen corresponding path program 1 times [2025-01-09 21:41:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11018187] [2025-01-09 21:41:12,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,585 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:41:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11018187] [2025-01-09 21:41:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11018187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411989509] [2025-01-09 21:41:12,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:12,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:12,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 897 [2025-01-09 21:41:12,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 242 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:41:12,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 897 [2025-01-09 21:41:12,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:12,819 INFO L124 PetriNetUnfolderBase]: 49/1202 cut-off events. [2025-01-09 21:41:12,819 INFO L125 PetriNetUnfolderBase]: For 2577/2577 co-relation queries the response was YES. [2025-01-09 21:41:12,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 1202 events. 49/1202 cut-off events. For 2577/2577 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 3107 event pairs, 24 based on Foata normal form. 1/1102 useless extension candidates. Maximal degree in co-relation 1641. Up to 174 conditions per place. [2025-01-09 21:41:12,829 INFO L140 encePairwiseOnDemand]: 892/897 looper letters, 33 selfloop transitions, 2 changer transitions 1/239 dead transitions. [2025-01-09 21:41:12,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 239 transitions, 1149 flow [2025-01-09 21:41:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-01-09 21:41:12,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845782237086585 [2025-01-09 21:41:12,831 INFO L175 Difference]: Start difference. First operand has 288 places, 242 transitions, 1085 flow. Second operand 3 states and 2276 transitions. [2025-01-09 21:41:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 239 transitions, 1149 flow [2025-01-09 21:41:12,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 239 transitions, 686 flow, removed 231 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:12,835 INFO L231 Difference]: Finished difference. Result has 288 places, 238 transitions, 618 flow [2025-01-09 21:41:12,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=897, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=288, PETRI_TRANSITIONS=238} [2025-01-09 21:41:12,836 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 0 predicate places. [2025-01-09 21:41:12,836 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 238 transitions, 618 flow [2025-01-09 21:41:12,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:41:12,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-01-09 21:41:12,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1210933427, now seen corresponding path program 1 times [2025-01-09 21:41:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952122266] [2025-01-09 21:41:12,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:12,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:12,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,854 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:41:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952122266] [2025-01-09 21:41:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952122266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:12,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257605747] [2025-01-09 21:41:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:12,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:12,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 698 out of 897 [2025-01-09 21:41:12,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 238 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 699.0) internal successors, (2097), 3 states have internal predecessors, (2097), 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:41:12,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 698 of 897 [2025-01-09 21:41:12,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:13,044 INFO L124 PetriNetUnfolderBase]: 25/1078 cut-off events. [2025-01-09 21:41:13,045 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-01-09 21:41:13,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1078 events. 25/1078 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2309 event pairs, 0 based on Foata normal form. 24/1053 useless extension candidates. Maximal degree in co-relation 1304. Up to 125 conditions per place. [2025-01-09 21:41:13,052 INFO L140 encePairwiseOnDemand]: 891/897 looper letters, 31 selfloop transitions, 1 changer transitions 24/233 dead transitions. [2025-01-09 21:41:13,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 233 transitions, 676 flow [2025-01-09 21:41:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2025-01-09 21:41:13,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926421404682275 [2025-01-09 21:41:13,053 INFO L175 Difference]: Start difference. First operand has 288 places, 238 transitions, 618 flow. Second operand 3 states and 2133 transitions. [2025-01-09 21:41:13,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 233 transitions, 676 flow [2025-01-09 21:41:13,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 233 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:13,056 INFO L231 Difference]: Finished difference. Result has 282 places, 209 transitions, 556 flow [2025-01-09 21:41:13,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=897, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=282, PETRI_TRANSITIONS=209} [2025-01-09 21:41:13,056 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -6 predicate places. [2025-01-09 21:41:13,056 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 209 transitions, 556 flow [2025-01-09 21:41:13,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 699.0) internal successors, (2097), 3 states have internal predecessors, (2097), 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:41:13,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,057 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-01-09 21:41:13,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1925534318, now seen corresponding path program 1 times [2025-01-09 21:41:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322901667] [2025-01-09 21:41:13,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 21:41:13,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 21:41:13,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:13,113 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:41:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322901667] [2025-01-09 21:41:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322901667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95630180] [2025-01-09 21:41:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:13,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:13,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:13,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:13,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:13,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 897 [2025-01-09 21:41:13,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 209 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 778.25) internal successors, (3113), 4 states have internal predecessors, (3113), 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:41:13,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:13,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 897 [2025-01-09 21:41:13,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:13,287 INFO L124 PetriNetUnfolderBase]: 0/501 cut-off events. [2025-01-09 21:41:13,287 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-01-09 21:41:13,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 501 events. 0/501 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 275 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 0. Up to 26 conditions per place. [2025-01-09 21:41:13,288 INFO L140 encePairwiseOnDemand]: 893/897 looper letters, 27 selfloop transitions, 3 changer transitions 0/208 dead transitions. [2025-01-09 21:41:13,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 208 transitions, 614 flow [2025-01-09 21:41:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3115 transitions. [2025-01-09 21:41:13,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681716833890747 [2025-01-09 21:41:13,289 INFO L175 Difference]: Start difference. First operand has 282 places, 209 transitions, 556 flow. Second operand 4 states and 3115 transitions. [2025-01-09 21:41:13,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 208 transitions, 614 flow [2025-01-09 21:41:13,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 208 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:13,292 INFO L231 Difference]: Finished difference. Result has 259 places, 208 transitions, 559 flow [2025-01-09 21:41:13,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=897, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=559, PETRI_PLACES=259, PETRI_TRANSITIONS=208} [2025-01-09 21:41:13,292 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -29 predicate places. [2025-01-09 21:41:13,292 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 208 transitions, 559 flow [2025-01-09 21:41:13,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 778.25) internal successors, (3113), 4 states have internal predecessors, (3113), 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:41:13,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,293 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-01-09 21:41:13,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 915893499, now seen corresponding path program 1 times [2025-01-09 21:41:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194542092] [2025-01-09 21:41:13,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 21:41:13,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 21:41:13,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:13,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:13,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 21:41:13,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 21:41:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:13,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:13,375 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:13,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-01-09 21:41:13,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-01-09 21:41:13,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-01-09 21:41:13,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-01-09 21:41:13,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-01-09 21:41:13,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-01-09 21:41:13,377 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:13,378 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:13,378 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-01-09 21:41:13,455 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 956 places, 933 transitions, 3162 flow [2025-01-09 21:41:13,614 INFO L124 PetriNetUnfolderBase]: 102/1603 cut-off events. [2025-01-09 21:41:13,615 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2025-01-09 21:41:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1603 events. 102/1603 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4542 event pairs, 0 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 1977. Up to 50 conditions per place. [2025-01-09 21:41:13,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 956 places, 933 transitions, 3162 flow [2025-01-09 21:41:13,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 249 transitions, 1149 flow [2025-01-09 21:41:13,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:13,631 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:13,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-09 21:41:13,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:13,631 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:13,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:13,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:13,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1132902644, now seen corresponding path program 1 times [2025-01-09 21:41:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561170299] [2025-01-09 21:41:13,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:13,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:13,652 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:41:13,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:13,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561170299] [2025-01-09 21:41:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561170299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:13,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035487727] [2025-01-09 21:41:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:13,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:13,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:13,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:13,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 776 out of 933 [2025-01-09 21:41:13,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 249 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 777.3333333333334) internal successors, (2332), 3 states have internal predecessors, (2332), 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:41:13,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:13,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 776 of 933 [2025-01-09 21:41:13,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:13,894 INFO L124 PetriNetUnfolderBase]: 51/1251 cut-off events. [2025-01-09 21:41:13,894 INFO L125 PetriNetUnfolderBase]: For 2901/2901 co-relation queries the response was YES. [2025-01-09 21:41:13,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1251 events. 51/1251 cut-off events. For 2901/2901 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3376 event pairs, 25 based on Foata normal form. 1/1147 useless extension candidates. Maximal degree in co-relation 1723. Up to 181 conditions per place. [2025-01-09 21:41:13,904 INFO L140 encePairwiseOnDemand]: 928/933 looper letters, 34 selfloop transitions, 2 changer transitions 1/246 dead transitions. [2025-01-09 21:41:13,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 246 transitions, 1215 flow [2025-01-09 21:41:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2367 transitions. [2025-01-09 21:41:13,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8456591639871383 [2025-01-09 21:41:13,906 INFO L175 Difference]: Start difference. First operand has 297 places, 249 transitions, 1149 flow. Second operand 3 states and 2367 transitions. [2025-01-09 21:41:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 246 transitions, 1215 flow [2025-01-09 21:41:13,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 246 transitions, 708 flow, removed 253 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:13,912 INFO L231 Difference]: Finished difference. Result has 297 places, 245 transitions, 638 flow [2025-01-09 21:41:13,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=933, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=297, PETRI_TRANSITIONS=245} [2025-01-09 21:41:13,912 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, 0 predicate places. [2025-01-09 21:41:13,913 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 245 transitions, 638 flow [2025-01-09 21:41:13,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 777.3333333333334) internal successors, (2332), 3 states have internal predecessors, (2332), 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:41:13,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-01-09 21:41:13,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:13,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash -437125646, now seen corresponding path program 1 times [2025-01-09 21:41:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-01-09 21:41:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:13,933 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:41:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-01-09 21:41:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968489748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085312033] [2025-01-09 21:41:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:13,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:13,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:13,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:14,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 933 [2025-01-09 21:41:14,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 245 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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:41:14,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:14,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 933 [2025-01-09 21:41:14,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:14,139 INFO L124 PetriNetUnfolderBase]: 26/1122 cut-off events. [2025-01-09 21:41:14,139 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2025-01-09 21:41:14,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1122 events. 26/1122 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2484 event pairs, 0 based on Foata normal form. 25/1096 useless extension candidates. Maximal degree in co-relation 1358. Up to 130 conditions per place. [2025-01-09 21:41:14,147 INFO L140 encePairwiseOnDemand]: 927/933 looper letters, 32 selfloop transitions, 1 changer transitions 24/240 dead transitions. [2025-01-09 21:41:14,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 240 transitions, 698 flow [2025-01-09 21:41:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2025-01-09 21:41:14,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7924258663808503 [2025-01-09 21:41:14,148 INFO L175 Difference]: Start difference. First operand has 297 places, 245 transitions, 638 flow. Second operand 3 states and 2218 transitions. [2025-01-09 21:41:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 240 transitions, 698 flow [2025-01-09 21:41:14,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 240 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:14,151 INFO L231 Difference]: Finished difference. Result has 291 places, 216 transitions, 576 flow [2025-01-09 21:41:14,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=933, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=291, PETRI_TRANSITIONS=216} [2025-01-09 21:41:14,151 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -6 predicate places. [2025-01-09 21:41:14,151 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 216 transitions, 576 flow [2025-01-09 21:41:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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:41:14,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,152 INFO L206 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-01-09 21:41:14,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1648169288, now seen corresponding path program 1 times [2025-01-09 21:41:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692840518] [2025-01-09 21:41:14,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 21:41:14,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 21:41:14,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:14,291 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:41:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692840518] [2025-01-09 21:41:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692840518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492212980] [2025-01-09 21:41:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:14,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:14,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:14,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 802 out of 933 [2025-01-09 21:41:14,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 216 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 809.5) internal successors, (3238), 4 states have internal predecessors, (3238), 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:41:14,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:14,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 802 of 933 [2025-01-09 21:41:14,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:14,453 INFO L124 PetriNetUnfolderBase]: 0/521 cut-off events. [2025-01-09 21:41:14,453 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-01-09 21:41:14,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 521 events. 0/521 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 288 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 0. Up to 27 conditions per place. [2025-01-09 21:41:14,454 INFO L140 encePairwiseOnDemand]: 929/933 looper letters, 28 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2025-01-09 21:41:14,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 215 transitions, 636 flow [2025-01-09 21:41:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3240 transitions. [2025-01-09 21:41:14,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681672025723473 [2025-01-09 21:41:14,457 INFO L175 Difference]: Start difference. First operand has 291 places, 216 transitions, 576 flow. Second operand 4 states and 3240 transitions. [2025-01-09 21:41:14,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 215 transitions, 636 flow [2025-01-09 21:41:14,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 215 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:14,459 INFO L231 Difference]: Finished difference. Result has 268 places, 215 transitions, 579 flow [2025-01-09 21:41:14,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=933, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=268, PETRI_TRANSITIONS=215} [2025-01-09 21:41:14,460 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, -29 predicate places. [2025-01-09 21:41:14,460 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 215 transitions, 579 flow [2025-01-09 21:41:14,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 809.5) internal successors, (3238), 4 states have internal predecessors, (3238), 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:41:14,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,461 INFO L206 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-01-09 21:41:14,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1631950282, now seen corresponding path program 1 times [2025-01-09 21:41:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591970950] [2025-01-09 21:41:14,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-09 21:41:14,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-09 21:41:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:14,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:14,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-09 21:41:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-09 21:41:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:14,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:14,594 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2025-01-09 21:41:14,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2025-01-09 21:41:14,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2025-01-09 21:41:14,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2025-01-09 21:41:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-01-09 21:41:14,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:14,597 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:14,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-01-09 21:41:14,693 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:14,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 993 places, 969 transitions, 3338 flow [2025-01-09 21:41:14,956 INFO L124 PetriNetUnfolderBase]: 106/1666 cut-off events. [2025-01-09 21:41:14,957 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2025-01-09 21:41:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1666 events. 106/1666 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4738 event pairs, 0 based on Foata normal form. 0/1478 useless extension candidates. Maximal degree in co-relation 2068. Up to 52 conditions per place. [2025-01-09 21:41:14,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 993 places, 969 transitions, 3338 flow [2025-01-09 21:41:14,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 256 transitions, 1215 flow [2025-01-09 21:41:14,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:14,976 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:14,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-09 21:41:14,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:14,977 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:14,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:14,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:14,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:14,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash 745877228, now seen corresponding path program 1 times [2025-01-09 21:41:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713137721] [2025-01-09 21:41:14,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:14,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:14,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,001 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:41:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713137721] [2025-01-09 21:41:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713137721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734668280] [2025-01-09 21:41:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:15,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:15,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 806 out of 969 [2025-01-09 21:41:15,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 256 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 807.3333333333334) internal successors, (2422), 3 states have internal predecessors, (2422), 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:41:15,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:15,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 806 of 969 [2025-01-09 21:41:15,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,297 INFO L124 PetriNetUnfolderBase]: 53/1300 cut-off events. [2025-01-09 21:41:15,297 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2025-01-09 21:41:15,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1919 conditions, 1300 events. 53/1300 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3500 event pairs, 26 based on Foata normal form. 1/1192 useless extension candidates. Maximal degree in co-relation 1806. Up to 188 conditions per place. [2025-01-09 21:41:15,310 INFO L140 encePairwiseOnDemand]: 964/969 looper letters, 35 selfloop transitions, 2 changer transitions 1/253 dead transitions. [2025-01-09 21:41:15,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 253 transitions, 1283 flow [2025-01-09 21:41:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2458 transitions. [2025-01-09 21:41:15,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8455452356381149 [2025-01-09 21:41:15,311 INFO L175 Difference]: Start difference. First operand has 306 places, 256 transitions, 1215 flow. Second operand 3 states and 2458 transitions. [2025-01-09 21:41:15,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 253 transitions, 1283 flow [2025-01-09 21:41:15,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 253 transitions, 730 flow, removed 276 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:15,319 INFO L231 Difference]: Finished difference. Result has 306 places, 252 transitions, 658 flow [2025-01-09 21:41:15,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=306, PETRI_TRANSITIONS=252} [2025-01-09 21:41:15,320 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 0 predicate places. [2025-01-09 21:41:15,320 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 252 transitions, 658 flow [2025-01-09 21:41:15,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 807.3333333333334) internal successors, (2422), 3 states have internal predecessors, (2422), 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:41:15,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:15,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-01-09 21:41:15,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:15,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1718798149, now seen corresponding path program 1 times [2025-01-09 21:41:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609995274] [2025-01-09 21:41:15,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:15,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:15,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,342 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:41:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609995274] [2025-01-09 21:41:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609995274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077310913] [2025-01-09 21:41:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:15,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:15,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 969 [2025-01-09 21:41:15,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 252 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 755.0) internal successors, (2265), 3 states have internal predecessors, (2265), 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:41:15,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:15,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 969 [2025-01-09 21:41:15,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,560 INFO L124 PetriNetUnfolderBase]: 27/1166 cut-off events. [2025-01-09 21:41:15,560 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-01-09 21:41:15,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 1166 events. 27/1166 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2585 event pairs, 0 based on Foata normal form. 26/1139 useless extension candidates. Maximal degree in co-relation 1412. Up to 135 conditions per place. [2025-01-09 21:41:15,568 INFO L140 encePairwiseOnDemand]: 963/969 looper letters, 33 selfloop transitions, 1 changer transitions 24/247 dead transitions. [2025-01-09 21:41:15,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 247 transitions, 720 flow [2025-01-09 21:41:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2303 transitions. [2025-01-09 21:41:15,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7922256621947025 [2025-01-09 21:41:15,570 INFO L175 Difference]: Start difference. First operand has 306 places, 252 transitions, 658 flow. Second operand 3 states and 2303 transitions. [2025-01-09 21:41:15,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 247 transitions, 720 flow [2025-01-09 21:41:15,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 247 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:15,573 INFO L231 Difference]: Finished difference. Result has 300 places, 223 transitions, 596 flow [2025-01-09 21:41:15,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=300, PETRI_TRANSITIONS=223} [2025-01-09 21:41:15,573 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -6 predicate places. [2025-01-09 21:41:15,573 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 223 transitions, 596 flow [2025-01-09 21:41:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 755.0) internal successors, (2265), 3 states have internal predecessors, (2265), 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:41:15,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,574 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-01-09 21:41:15,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:15,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1761452933, now seen corresponding path program 1 times [2025-01-09 21:41:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015748235] [2025-01-09 21:41:15,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 21:41:15,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 21:41:15,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,636 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:41:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015748235] [2025-01-09 21:41:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015748235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384471432] [2025-01-09 21:41:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:15,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:15,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 833 out of 969 [2025-01-09 21:41:15,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 223 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 840.75) internal successors, (3363), 4 states have internal predecessors, (3363), 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:41:15,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:15,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 833 of 969 [2025-01-09 21:41:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,854 INFO L124 PetriNetUnfolderBase]: 0/541 cut-off events. [2025-01-09 21:41:15,854 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2025-01-09 21:41:15,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 541 events. 0/541 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 299 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. [2025-01-09 21:41:15,855 INFO L140 encePairwiseOnDemand]: 965/969 looper letters, 29 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-01-09 21:41:15,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 222 transitions, 658 flow [2025-01-09 21:41:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3365 transitions. [2025-01-09 21:41:15,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681630546955624 [2025-01-09 21:41:15,856 INFO L175 Difference]: Start difference. First operand has 300 places, 223 transitions, 596 flow. Second operand 4 states and 3365 transitions. [2025-01-09 21:41:15,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 222 transitions, 658 flow [2025-01-09 21:41:15,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 222 transitions, 657 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:15,859 INFO L231 Difference]: Finished difference. Result has 277 places, 222 transitions, 599 flow [2025-01-09 21:41:15,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=277, PETRI_TRANSITIONS=222} [2025-01-09 21:41:15,859 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -29 predicate places. [2025-01-09 21:41:15,859 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 222 transitions, 599 flow [2025-01-09 21:41:15,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 840.75) internal successors, (3363), 4 states have internal predecessors, (3363), 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:41:15,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,860 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-01-09 21:41:15,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1678752228, now seen corresponding path program 1 times [2025-01-09 21:41:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-01-09 21:41:15,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 21:41:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 21:41:15,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:15,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:15,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 21:41:15,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 21:41:15,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:15,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:15,950 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-01-09 21:41:15,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-01-09 21:41:15,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-01-09 21:41:15,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-01-09 21:41:15,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-01-09 21:41:15,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-01-09 21:41:15,952 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:15,952 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:15,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-01-09 21:41:16,029 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:16,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1030 places, 1005 transitions, 3518 flow [2025-01-09 21:41:16,217 INFO L124 PetriNetUnfolderBase]: 110/1729 cut-off events. [2025-01-09 21:41:16,218 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2025-01-09 21:41:16,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 1729 events. 110/1729 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4933 event pairs, 0 based on Foata normal form. 0/1534 useless extension candidates. Maximal degree in co-relation 2160. Up to 54 conditions per place. [2025-01-09 21:41:16,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 1030 places, 1005 transitions, 3518 flow [2025-01-09 21:41:16,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 263 transitions, 1283 flow [2025-01-09 21:41:16,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:16,238 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:16,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-09 21:41:16,238 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:16,239 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:16,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:16,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:16,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1856738892, now seen corresponding path program 1 times [2025-01-09 21:41:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-01-09 21:41:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:16,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:16,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:16,257 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:41:16,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:16,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-01-09 21:41:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651425952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076098718] [2025-01-09 21:41:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:16,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:16,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:16,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 836 out of 1005 [2025-01-09 21:41:16,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 263 transitions, 1283 flow. Second operand has 3 states, 3 states have (on average 837.3333333333334) internal successors, (2512), 3 states have internal predecessors, (2512), 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:41:16,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 836 of 1005 [2025-01-09 21:41:16,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:16,533 INFO L124 PetriNetUnfolderBase]: 55/1349 cut-off events. [2025-01-09 21:41:16,533 INFO L125 PetriNetUnfolderBase]: For 3628/3628 co-relation queries the response was YES. [2025-01-09 21:41:16,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 1349 events. 55/1349 cut-off events. For 3628/3628 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3666 event pairs, 27 based on Foata normal form. 1/1237 useless extension candidates. Maximal degree in co-relation 1890. Up to 195 conditions per place. [2025-01-09 21:41:16,545 INFO L140 encePairwiseOnDemand]: 1000/1005 looper letters, 36 selfloop transitions, 2 changer transitions 1/260 dead transitions. [2025-01-09 21:41:16,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 260 transitions, 1353 flow [2025-01-09 21:41:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2549 transitions. [2025-01-09 21:41:16,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8454394693200663 [2025-01-09 21:41:16,546 INFO L175 Difference]: Start difference. First operand has 315 places, 263 transitions, 1283 flow. Second operand 3 states and 2549 transitions. [2025-01-09 21:41:16,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 260 transitions, 1353 flow [2025-01-09 21:41:16,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 260 transitions, 752 flow, removed 300 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:16,552 INFO L231 Difference]: Finished difference. Result has 315 places, 259 transitions, 678 flow [2025-01-09 21:41:16,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1005, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=315, PETRI_TRANSITIONS=259} [2025-01-09 21:41:16,552 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 0 predicate places. [2025-01-09 21:41:16,552 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 259 transitions, 678 flow [2025-01-09 21:41:16,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 837.3333333333334) internal successors, (2512), 3 states have internal predecessors, (2512), 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:41:16,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:16,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-01-09 21:41:16,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash -760983640, now seen corresponding path program 1 times [2025-01-09 21:41:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245050233] [2025-01-09 21:41:16,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:16,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:16,571 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:41:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245050233] [2025-01-09 21:41:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245050233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:16,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27088550] [2025-01-09 21:41:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:16,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:16,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:16,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 782 out of 1005 [2025-01-09 21:41:16,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 259 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 783.0) internal successors, (2349), 3 states have internal predecessors, (2349), 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:41:16,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 782 of 1005 [2025-01-09 21:41:16,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:16,800 INFO L124 PetriNetUnfolderBase]: 28/1210 cut-off events. [2025-01-09 21:41:16,800 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-01-09 21:41:16,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1210 events. 28/1210 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2688 event pairs, 0 based on Foata normal form. 27/1182 useless extension candidates. Maximal degree in co-relation 1466. Up to 140 conditions per place. [2025-01-09 21:41:16,810 INFO L140 encePairwiseOnDemand]: 999/1005 looper letters, 34 selfloop transitions, 1 changer transitions 24/254 dead transitions. [2025-01-09 21:41:16,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 254 transitions, 742 flow [2025-01-09 21:41:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2388 transitions. [2025-01-09 21:41:16,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920398009950249 [2025-01-09 21:41:16,811 INFO L175 Difference]: Start difference. First operand has 315 places, 259 transitions, 678 flow. Second operand 3 states and 2388 transitions. [2025-01-09 21:41:16,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 254 transitions, 742 flow [2025-01-09 21:41:16,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 254 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:16,814 INFO L231 Difference]: Finished difference. Result has 309 places, 230 transitions, 616 flow [2025-01-09 21:41:16,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1005, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=309, PETRI_TRANSITIONS=230} [2025-01-09 21:41:16,815 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -6 predicate places. [2025-01-09 21:41:16,815 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 230 transitions, 616 flow [2025-01-09 21:41:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 783.0) internal successors, (2349), 3 states have internal predecessors, (2349), 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:41:16,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,815 INFO L206 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-01-09 21:41:16,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash -269878967, now seen corresponding path program 1 times [2025-01-09 21:41:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883732408] [2025-01-09 21:41:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-09 21:41:16,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-09 21:41:16,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:16,879 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:41:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883732408] [2025-01-09 21:41:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883732408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887842193] [2025-01-09 21:41:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:16,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:16,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:16,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 864 out of 1005 [2025-01-09 21:41:16,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 230 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 872.0) internal successors, (3488), 4 states have internal predecessors, (3488), 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:41:16,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 864 of 1005 [2025-01-09 21:41:16,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:17,042 INFO L124 PetriNetUnfolderBase]: 0/561 cut-off events. [2025-01-09 21:41:17,042 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-01-09 21:41:17,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 561 events. 0/561 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 311 event pairs, 0 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 0. Up to 29 conditions per place. [2025-01-09 21:41:17,043 INFO L140 encePairwiseOnDemand]: 1001/1005 looper letters, 30 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-01-09 21:41:17,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 229 transitions, 680 flow [2025-01-09 21:41:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3490 transitions. [2025-01-09 21:41:17,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2025-01-09 21:41:17,045 INFO L175 Difference]: Start difference. First operand has 309 places, 230 transitions, 616 flow. Second operand 4 states and 3490 transitions. [2025-01-09 21:41:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 229 transitions, 680 flow [2025-01-09 21:41:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 229 transitions, 679 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:17,047 INFO L231 Difference]: Finished difference. Result has 286 places, 229 transitions, 619 flow [2025-01-09 21:41:17,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1005, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=619, PETRI_PLACES=286, PETRI_TRANSITIONS=229} [2025-01-09 21:41:17,048 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2025-01-09 21:41:17,048 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 229 transitions, 619 flow [2025-01-09 21:41:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 872.0) internal successors, (3488), 4 states have internal predecessors, (3488), 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:41:17,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,049 INFO L206 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-01-09 21:41:17,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -308315987, now seen corresponding path program 1 times [2025-01-09 21:41:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507534270] [2025-01-09 21:41:17,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 21:41:17,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 21:41:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:17,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:17,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 21:41:17,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 21:41:17,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:17,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:17,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:17,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2025-01-09 21:41:17,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2025-01-09 21:41:17,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2025-01-09 21:41:17,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2025-01-09 21:41:17,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 34 remaining) [2025-01-09 21:41:17,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2025-01-09 21:41:17,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2025-01-09 21:41:17,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-01-09 21:41:17,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:17,229 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:17,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-01-09 21:41:17,324 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:17,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1067 places, 1041 transitions, 3702 flow [2025-01-09 21:41:17,519 INFO L124 PetriNetUnfolderBase]: 114/1792 cut-off events. [2025-01-09 21:41:17,519 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2025-01-09 21:41:17,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2308 conditions, 1792 events. 114/1792 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5095 event pairs, 0 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 2253. Up to 56 conditions per place. [2025-01-09 21:41:17,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 1067 places, 1041 transitions, 3702 flow [2025-01-09 21:41:17,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 270 transitions, 1353 flow [2025-01-09 21:41:17,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:17,538 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:17,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-09 21:41:17,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:17,539 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:17,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:17,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:17,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2095284948, now seen corresponding path program 1 times [2025-01-09 21:41:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887496514] [2025-01-09 21:41:17,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:17,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:17,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:17,557 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:41:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887496514] [2025-01-09 21:41:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887496514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194465861] [2025-01-09 21:41:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:17,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:17,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:17,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:17,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 1041 [2025-01-09 21:41:17,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 270 transitions, 1353 flow. Second operand has 3 states, 3 states have (on average 867.3333333333334) internal successors, (2602), 3 states have internal predecessors, (2602), 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:41:17,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:17,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 1041 [2025-01-09 21:41:17,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:17,837 INFO L124 PetriNetUnfolderBase]: 57/1398 cut-off events. [2025-01-09 21:41:17,837 INFO L125 PetriNetUnfolderBase]: For 4033/4033 co-relation queries the response was YES. [2025-01-09 21:41:17,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 1398 events. 57/1398 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 3638 event pairs, 28 based on Foata normal form. 1/1282 useless extension candidates. Maximal degree in co-relation 1975. Up to 202 conditions per place. [2025-01-09 21:41:17,850 INFO L140 encePairwiseOnDemand]: 1036/1041 looper letters, 37 selfloop transitions, 2 changer transitions 1/267 dead transitions. [2025-01-09 21:41:17,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 267 transitions, 1425 flow [2025-01-09 21:41:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2640 transitions. [2025-01-09 21:41:17,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453410182516811 [2025-01-09 21:41:17,855 INFO L175 Difference]: Start difference. First operand has 324 places, 270 transitions, 1353 flow. Second operand 3 states and 2640 transitions. [2025-01-09 21:41:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 267 transitions, 1425 flow [2025-01-09 21:41:17,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 267 transitions, 774 flow, removed 325 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:17,861 INFO L231 Difference]: Finished difference. Result has 324 places, 266 transitions, 698 flow [2025-01-09 21:41:17,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1041, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=324, PETRI_TRANSITIONS=266} [2025-01-09 21:41:17,862 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, 0 predicate places. [2025-01-09 21:41:17,862 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 266 transitions, 698 flow [2025-01-09 21:41:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 867.3333333333334) internal successors, (2602), 3 states have internal predecessors, (2602), 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:41:17,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:17,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-01-09 21:41:17,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:17,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1858649415, now seen corresponding path program 1 times [2025-01-09 21:41:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050886351] [2025-01-09 21:41:17,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:17,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:17,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:17,880 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:41:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050886351] [2025-01-09 21:41:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050886351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:17,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133935686] [2025-01-09 21:41:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:17,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:17,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:17,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:17,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 810 out of 1041 [2025-01-09 21:41:17,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 266 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 811.0) internal successors, (2433), 3 states have internal predecessors, (2433), 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:41:17,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:17,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 810 of 1041 [2025-01-09 21:41:17,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:18,149 INFO L124 PetriNetUnfolderBase]: 29/1254 cut-off events. [2025-01-09 21:41:18,150 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-01-09 21:41:18,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1254 events. 29/1254 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2706 event pairs, 0 based on Foata normal form. 28/1225 useless extension candidates. Maximal degree in co-relation 1520. Up to 145 conditions per place. [2025-01-09 21:41:18,161 INFO L140 encePairwiseOnDemand]: 1035/1041 looper letters, 35 selfloop transitions, 1 changer transitions 24/261 dead transitions. [2025-01-09 21:41:18,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 261 transitions, 764 flow [2025-01-09 21:41:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2473 transitions. [2025-01-09 21:41:18,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7918667947486391 [2025-01-09 21:41:18,165 INFO L175 Difference]: Start difference. First operand has 324 places, 266 transitions, 698 flow. Second operand 3 states and 2473 transitions. [2025-01-09 21:41:18,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 261 transitions, 764 flow [2025-01-09 21:41:18,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 261 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:18,167 INFO L231 Difference]: Finished difference. Result has 318 places, 237 transitions, 636 flow [2025-01-09 21:41:18,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1041, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=318, PETRI_TRANSITIONS=237} [2025-01-09 21:41:18,168 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, -6 predicate places. [2025-01-09 21:41:18,168 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 237 transitions, 636 flow [2025-01-09 21:41:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 811.0) internal successors, (2433), 3 states have internal predecessors, (2433), 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:41:18,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:18,168 INFO L206 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:18,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-01-09 21:41:18,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1788262292, now seen corresponding path program 1 times [2025-01-09 21:41:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834720225] [2025-01-09 21:41:18,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 21:41:18,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 21:41:18,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:18,242 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:41:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834720225] [2025-01-09 21:41:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834720225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616220509] [2025-01-09 21:41:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:18,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:18,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:18,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 895 out of 1041 [2025-01-09 21:41:18,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 237 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 903.25) internal successors, (3613), 4 states have internal predecessors, (3613), 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:41:18,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:18,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 895 of 1041 [2025-01-09 21:41:18,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:18,439 INFO L124 PetriNetUnfolderBase]: 0/581 cut-off events. [2025-01-09 21:41:18,439 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-01-09 21:41:18,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 581 events. 0/581 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 324 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 0. Up to 30 conditions per place. [2025-01-09 21:41:18,440 INFO L140 encePairwiseOnDemand]: 1037/1041 looper letters, 31 selfloop transitions, 3 changer transitions 0/236 dead transitions. [2025-01-09 21:41:18,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 236 transitions, 702 flow [2025-01-09 21:41:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3615 transitions. [2025-01-09 21:41:18,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681556195965417 [2025-01-09 21:41:18,442 INFO L175 Difference]: Start difference. First operand has 318 places, 237 transitions, 636 flow. Second operand 4 states and 3615 transitions. [2025-01-09 21:41:18,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 236 transitions, 702 flow [2025-01-09 21:41:18,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 236 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:18,444 INFO L231 Difference]: Finished difference. Result has 295 places, 236 transitions, 639 flow [2025-01-09 21:41:18,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1041, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=639, PETRI_PLACES=295, PETRI_TRANSITIONS=236} [2025-01-09 21:41:18,445 INFO L279 CegarLoopForPetriNet]: 324 programPoint places, -29 predicate places. [2025-01-09 21:41:18,445 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 236 transitions, 639 flow [2025-01-09 21:41:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 903.25) internal successors, (3613), 4 states have internal predecessors, (3613), 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:41:18,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:18,445 INFO L206 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:18,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-01-09 21:41:18,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash -354743831, now seen corresponding path program 1 times [2025-01-09 21:41:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-01-09 21:41:18,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 21:41:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 21:41:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:18,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:18,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 21:41:18,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 21:41:18,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:18,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:18,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:18,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-01-09 21:41:18,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-01-09 21:41:18,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-01-09 21:41:18,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-01-09 21:41:18,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-01-09 21:41:18,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-01-09 21:41:18,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-01-09 21:41:18,627 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:18,628 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:18,628 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-01-09 21:41:18,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:18,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1104 places, 1077 transitions, 3890 flow [2025-01-09 21:41:18,938 INFO L124 PetriNetUnfolderBase]: 118/1855 cut-off events. [2025-01-09 21:41:18,938 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2025-01-09 21:41:18,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 1855 events. 118/1855 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5208 event pairs, 0 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 2347. Up to 58 conditions per place. [2025-01-09 21:41:18,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 1104 places, 1077 transitions, 3890 flow [2025-01-09 21:41:18,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 277 transitions, 1425 flow [2025-01-09 21:41:18,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:18,959 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:18,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-09 21:41:18,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:18,960 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:18,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:18,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:18,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:18,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1774707596, now seen corresponding path program 1 times [2025-01-09 21:41:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753617210] [2025-01-09 21:41:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:18,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:18,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:18,981 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:41:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753617210] [2025-01-09 21:41:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753617210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:18,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663903084] [2025-01-09 21:41:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:18,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:18,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:18,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:19,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 896 out of 1077 [2025-01-09 21:41:19,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 277 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 897.3333333333334) internal successors, (2692), 3 states have internal predecessors, (2692), 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:41:19,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:19,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 896 of 1077 [2025-01-09 21:41:19,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:19,280 INFO L124 PetriNetUnfolderBase]: 59/1447 cut-off events. [2025-01-09 21:41:19,281 INFO L125 PetriNetUnfolderBase]: For 4467/4467 co-relation queries the response was YES. [2025-01-09 21:41:19,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 1447 events. 59/1447 cut-off events. For 4467/4467 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3916 event pairs, 29 based on Foata normal form. 1/1327 useless extension candidates. Maximal degree in co-relation 2061. Up to 209 conditions per place. [2025-01-09 21:41:19,295 INFO L140 encePairwiseOnDemand]: 1072/1077 looper letters, 38 selfloop transitions, 2 changer transitions 1/274 dead transitions. [2025-01-09 21:41:19,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 274 transitions, 1499 flow [2025-01-09 21:41:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2731 transitions. [2025-01-09 21:41:19,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452491488703188 [2025-01-09 21:41:19,297 INFO L175 Difference]: Start difference. First operand has 333 places, 277 transitions, 1425 flow. Second operand 3 states and 2731 transitions. [2025-01-09 21:41:19,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 274 transitions, 1499 flow [2025-01-09 21:41:19,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 274 transitions, 796 flow, removed 351 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:19,303 INFO L231 Difference]: Finished difference. Result has 333 places, 273 transitions, 718 flow [2025-01-09 21:41:19,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1077, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=333, PETRI_TRANSITIONS=273} [2025-01-09 21:41:19,304 INFO L279 CegarLoopForPetriNet]: 333 programPoint places, 0 predicate places. [2025-01-09 21:41:19,304 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 273 transitions, 718 flow [2025-01-09 21:41:19,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 897.3333333333334) internal successors, (2692), 3 states have internal predecessors, (2692), 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:41:19,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-01-09 21:41:19,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:19,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash -716828178, now seen corresponding path program 1 times [2025-01-09 21:41:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980659189] [2025-01-09 21:41:19,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:19,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:19,323 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:41:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980659189] [2025-01-09 21:41:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980659189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498772934] [2025-01-09 21:41:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:19,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:19,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:19,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 838 out of 1077 [2025-01-09 21:41:19,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 273 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 839.0) internal successors, (2517), 3 states have internal predecessors, (2517), 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:41:19,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:19,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 838 of 1077 [2025-01-09 21:41:19,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:19,565 INFO L124 PetriNetUnfolderBase]: 30/1298 cut-off events. [2025-01-09 21:41:19,565 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-01-09 21:41:19,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 1298 events. 30/1298 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2891 event pairs, 0 based on Foata normal form. 29/1268 useless extension candidates. Maximal degree in co-relation 1574. Up to 150 conditions per place. [2025-01-09 21:41:19,577 INFO L140 encePairwiseOnDemand]: 1071/1077 looper letters, 36 selfloop transitions, 1 changer transitions 24/268 dead transitions. [2025-01-09 21:41:19,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 268 transitions, 786 flow [2025-01-09 21:41:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2558 transitions. [2025-01-09 21:41:19,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7917053543794491 [2025-01-09 21:41:19,579 INFO L175 Difference]: Start difference. First operand has 333 places, 273 transitions, 718 flow. Second operand 3 states and 2558 transitions. [2025-01-09 21:41:19,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 268 transitions, 786 flow [2025-01-09 21:41:19,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 268 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:19,582 INFO L231 Difference]: Finished difference. Result has 327 places, 244 transitions, 656 flow [2025-01-09 21:41:19,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1077, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=327, PETRI_TRANSITIONS=244} [2025-01-09 21:41:19,582 INFO L279 CegarLoopForPetriNet]: 333 programPoint places, -6 predicate places. [2025-01-09 21:41:19,582 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 244 transitions, 656 flow [2025-01-09 21:41:19,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 839.0) internal successors, (2517), 3 states have internal predecessors, (2517), 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:41:19,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,583 INFO L206 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-01-09 21:41:19,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:19,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 934253414, now seen corresponding path program 1 times [2025-01-09 21:41:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566773486] [2025-01-09 21:41:19,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 21:41:19,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 21:41:19,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566773486] [2025-01-09 21:41:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566773486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:19,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:19,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266404299] [2025-01-09 21:41:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:19,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:19,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:19,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 926 out of 1077 [2025-01-09 21:41:19,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 244 transitions, 656 flow. Second operand has 4 states, 4 states have (on average 934.5) internal successors, (3738), 4 states have internal predecessors, (3738), 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:41:19,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:19,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 926 of 1077 [2025-01-09 21:41:19,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:19,918 INFO L124 PetriNetUnfolderBase]: 0/601 cut-off events. [2025-01-09 21:41:19,918 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-01-09 21:41:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 601 events. 0/601 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 335 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 0. Up to 31 conditions per place. [2025-01-09 21:41:19,919 INFO L140 encePairwiseOnDemand]: 1073/1077 looper letters, 32 selfloop transitions, 3 changer transitions 0/243 dead transitions. [2025-01-09 21:41:19,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 243 transitions, 724 flow [2025-01-09 21:41:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3740 transitions. [2025-01-09 21:41:19,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681522748375116 [2025-01-09 21:41:19,922 INFO L175 Difference]: Start difference. First operand has 327 places, 244 transitions, 656 flow. Second operand 4 states and 3740 transitions. [2025-01-09 21:41:19,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 243 transitions, 724 flow [2025-01-09 21:41:19,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 243 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:19,925 INFO L231 Difference]: Finished difference. Result has 304 places, 243 transitions, 659 flow [2025-01-09 21:41:19,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1077, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=659, PETRI_PLACES=304, PETRI_TRANSITIONS=243} [2025-01-09 21:41:19,925 INFO L279 CegarLoopForPetriNet]: 333 programPoint places, -29 predicate places. [2025-01-09 21:41:19,925 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 243 transitions, 659 flow [2025-01-09 21:41:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 934.5) internal successors, (3738), 4 states have internal predecessors, (3738), 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:41:19,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,926 INFO L206 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-01-09 21:41:19,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1307742672, now seen corresponding path program 1 times [2025-01-09 21:41:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442446731] [2025-01-09 21:41:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:19,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 21:41:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 21:41:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:19,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:19,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 21:41:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 21:41:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:20,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:20,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-01-09 21:41:20,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-01-09 21:41:20,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-01-09 21:41:20,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-01-09 21:41:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-01-09 21:41:20,102 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:20,103 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:20,103 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-01-09 21:41:20,221 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:20,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1141 places, 1113 transitions, 4082 flow [2025-01-09 21:41:20,566 INFO L124 PetriNetUnfolderBase]: 122/1918 cut-off events. [2025-01-09 21:41:20,566 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2025-01-09 21:41:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1918 events. 122/1918 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5473 event pairs, 0 based on Foata normal form. 0/1702 useless extension candidates. Maximal degree in co-relation 2442. Up to 60 conditions per place. [2025-01-09 21:41:20,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 1141 places, 1113 transitions, 4082 flow [2025-01-09 21:41:20,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 284 transitions, 1499 flow [2025-01-09 21:41:20,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:20,590 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:20,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:41:20,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:20,592 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:20,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:20,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:20,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:20,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:20,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash 581814636, now seen corresponding path program 1 times [2025-01-09 21:41:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897045960] [2025-01-09 21:41:20,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:20,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897045960] [2025-01-09 21:41:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897045960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602281774] [2025-01-09 21:41:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:20,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 926 out of 1113 [2025-01-09 21:41:20,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 284 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 927.3333333333334) internal successors, (2782), 3 states have internal predecessors, (2782), 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:41:20,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:20,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 926 of 1113 [2025-01-09 21:41:20,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:21,052 INFO L124 PetriNetUnfolderBase]: 61/1496 cut-off events. [2025-01-09 21:41:21,052 INFO L125 PetriNetUnfolderBase]: For 4931/4931 co-relation queries the response was YES. [2025-01-09 21:41:21,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1496 events. 61/1496 cut-off events. For 4931/4931 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4084 event pairs, 30 based on Foata normal form. 1/1372 useless extension candidates. Maximal degree in co-relation 2148. Up to 216 conditions per place. [2025-01-09 21:41:21,068 INFO L140 encePairwiseOnDemand]: 1108/1113 looper letters, 39 selfloop transitions, 2 changer transitions 1/281 dead transitions. [2025-01-09 21:41:21,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 281 transitions, 1575 flow [2025-01-09 21:41:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2822 transitions. [2025-01-09 21:41:21,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845163222521713 [2025-01-09 21:41:21,070 INFO L175 Difference]: Start difference. First operand has 342 places, 284 transitions, 1499 flow. Second operand 3 states and 2822 transitions. [2025-01-09 21:41:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 281 transitions, 1575 flow [2025-01-09 21:41:21,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 281 transitions, 818 flow, removed 378 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:21,080 INFO L231 Difference]: Finished difference. Result has 342 places, 280 transitions, 738 flow [2025-01-09 21:41:21,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=342, PETRI_TRANSITIONS=280} [2025-01-09 21:41:21,080 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, 0 predicate places. [2025-01-09 21:41:21,080 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 280 transitions, 738 flow [2025-01-09 21:41:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 927.3333333333334) internal successors, (2782), 3 states have internal predecessors, (2782), 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:41:21,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:21,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-01-09 21:41:21,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1630487225, now seen corresponding path program 1 times [2025-01-09 21:41:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580389373] [2025-01-09 21:41:21,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:21,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:21,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:21,111 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:41:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580389373] [2025-01-09 21:41:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580389373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039054927] [2025-01-09 21:41:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:21,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:21,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:21,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 1113 [2025-01-09 21:41:21,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 280 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 867.0) internal successors, (2601), 3 states have internal predecessors, (2601), 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:41:21,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:21,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 1113 [2025-01-09 21:41:21,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:21,410 INFO L124 PetriNetUnfolderBase]: 31/1342 cut-off events. [2025-01-09 21:41:21,410 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-01-09 21:41:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1342 events. 31/1342 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2993 event pairs, 0 based on Foata normal form. 30/1311 useless extension candidates. Maximal degree in co-relation 1628. Up to 155 conditions per place. [2025-01-09 21:41:21,422 INFO L140 encePairwiseOnDemand]: 1107/1113 looper letters, 37 selfloop transitions, 1 changer transitions 24/275 dead transitions. [2025-01-09 21:41:21,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 275 transitions, 808 flow [2025-01-09 21:41:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2643 transitions. [2025-01-09 21:41:21,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915543575920935 [2025-01-09 21:41:21,423 INFO L175 Difference]: Start difference. First operand has 342 places, 280 transitions, 738 flow. Second operand 3 states and 2643 transitions. [2025-01-09 21:41:21,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 275 transitions, 808 flow [2025-01-09 21:41:21,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 275 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:21,426 INFO L231 Difference]: Finished difference. Result has 336 places, 251 transitions, 676 flow [2025-01-09 21:41:21,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=336, PETRI_TRANSITIONS=251} [2025-01-09 21:41:21,427 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -6 predicate places. [2025-01-09 21:41:21,427 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 251 transitions, 676 flow [2025-01-09 21:41:21,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 867.0) internal successors, (2601), 3 states have internal predecessors, (2601), 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:41:21,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,427 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-01-09 21:41:21,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1410903617, now seen corresponding path program 1 times [2025-01-09 21:41:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072513311] [2025-01-09 21:41:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 21:41:21,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 21:41:21,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:21,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:41:21,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:21,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072513311] [2025-01-09 21:41:21,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072513311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:21,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:21,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:21,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058724912] [2025-01-09 21:41:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:21,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:21,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:21,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:21,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 957 out of 1113 [2025-01-09 21:41:21,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 251 transitions, 676 flow. Second operand has 4 states, 4 states have (on average 965.75) internal successors, (3863), 4 states have internal predecessors, (3863), 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:41:21,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:21,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 957 of 1113 [2025-01-09 21:41:21,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:21,654 INFO L124 PetriNetUnfolderBase]: 0/621 cut-off events. [2025-01-09 21:41:21,654 INFO L125 PetriNetUnfolderBase]: For 491/491 co-relation queries the response was YES. [2025-01-09 21:41:21,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 621 events. 0/621 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 347 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 0. Up to 32 conditions per place. [2025-01-09 21:41:21,654 INFO L140 encePairwiseOnDemand]: 1109/1113 looper letters, 33 selfloop transitions, 3 changer transitions 0/250 dead transitions. [2025-01-09 21:41:21,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 250 transitions, 746 flow [2025-01-09 21:41:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3865 transitions. [2025-01-09 21:41:21,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681491464510332 [2025-01-09 21:41:21,656 INFO L175 Difference]: Start difference. First operand has 336 places, 251 transitions, 676 flow. Second operand 4 states and 3865 transitions. [2025-01-09 21:41:21,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 250 transitions, 746 flow [2025-01-09 21:41:21,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 250 transitions, 745 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:21,659 INFO L231 Difference]: Finished difference. Result has 313 places, 250 transitions, 679 flow [2025-01-09 21:41:21,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=313, PETRI_TRANSITIONS=250} [2025-01-09 21:41:21,659 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -29 predicate places. [2025-01-09 21:41:21,659 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 250 transitions, 679 flow [2025-01-09 21:41:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 965.75) internal successors, (3863), 4 states have internal predecessors, (3863), 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:41:21,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,660 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-01-09 21:41:21,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:21,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -519948190, now seen corresponding path program 1 times [2025-01-09 21:41:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175577871] [2025-01-09 21:41:21,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 21:41:21,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 21:41:21,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:21,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:21,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 21:41:21,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 21:41:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:21,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:21,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-01-09 21:41:21,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-01-09 21:41:21,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-01-09 21:41:21,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-01-09 21:41:21,778 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:21,779 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:21,779 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-01-09 21:41:21,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1178 places, 1149 transitions, 4278 flow [2025-01-09 21:41:22,182 INFO L124 PetriNetUnfolderBase]: 126/1981 cut-off events. [2025-01-09 21:41:22,182 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2025-01-09 21:41:22,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1981 events. 126/1981 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5641 event pairs, 0 based on Foata normal form. 0/1758 useless extension candidates. Maximal degree in co-relation 2538. Up to 62 conditions per place. [2025-01-09 21:41:22,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 1178 places, 1149 transitions, 4278 flow [2025-01-09 21:41:22,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 291 transitions, 1575 flow [2025-01-09 21:41:22,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:22,203 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:22,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:41:22,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:22,204 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:22,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:22,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:22,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:22,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:22,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1378996532, now seen corresponding path program 1 times [2025-01-09 21:41:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45441817] [2025-01-09 21:41:22,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:22,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:22,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:22,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:22,224 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:41:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45441817] [2025-01-09 21:41:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45441817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191250657] [2025-01-09 21:41:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:22,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:22,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:22,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:22,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 956 out of 1149 [2025-01-09 21:41:22,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 291 transitions, 1575 flow. Second operand has 3 states, 3 states have (on average 957.3333333333334) internal successors, (2872), 3 states have internal predecessors, (2872), 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:41:22,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:22,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 956 of 1149 [2025-01-09 21:41:22,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:22,546 INFO L124 PetriNetUnfolderBase]: 63/1545 cut-off events. [2025-01-09 21:41:22,546 INFO L125 PetriNetUnfolderBase]: For 5426/5426 co-relation queries the response was YES. [2025-01-09 21:41:22,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 1545 events. 63/1545 cut-off events. For 5426/5426 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4049 event pairs, 31 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 2236. Up to 223 conditions per place. [2025-01-09 21:41:22,564 INFO L140 encePairwiseOnDemand]: 1144/1149 looper letters, 40 selfloop transitions, 2 changer transitions 1/288 dead transitions. [2025-01-09 21:41:22,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 288 transitions, 1653 flow [2025-01-09 21:41:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2913 transitions. [2025-01-09 21:41:22,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845082680591819 [2025-01-09 21:41:22,569 INFO L175 Difference]: Start difference. First operand has 351 places, 291 transitions, 1575 flow. Second operand 3 states and 2913 transitions. [2025-01-09 21:41:22,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 288 transitions, 1653 flow [2025-01-09 21:41:22,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 288 transitions, 840 flow, removed 406 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:22,576 INFO L231 Difference]: Finished difference. Result has 351 places, 287 transitions, 758 flow [2025-01-09 21:41:22,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1149, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=351, PETRI_TRANSITIONS=287} [2025-01-09 21:41:22,577 INFO L279 CegarLoopForPetriNet]: 351 programPoint places, 0 predicate places. [2025-01-09 21:41:22,577 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 287 transitions, 758 flow [2025-01-09 21:41:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 957.3333333333334) internal successors, (2872), 3 states have internal predecessors, (2872), 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:41:22,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:22,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-01-09 21:41:22,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash -304659260, now seen corresponding path program 1 times [2025-01-09 21:41:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50106363] [2025-01-09 21:41:22,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:22,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:22,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:22,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:22,597 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:41:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50106363] [2025-01-09 21:41:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50106363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:22,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504160154] [2025-01-09 21:41:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:22,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:22,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:22,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 894 out of 1149 [2025-01-09 21:41:22,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 287 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 895.0) internal successors, (2685), 3 states have internal predecessors, (2685), 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:41:22,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:22,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 894 of 1149 [2025-01-09 21:41:22,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:22,862 INFO L124 PetriNetUnfolderBase]: 32/1386 cut-off events. [2025-01-09 21:41:22,862 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-01-09 21:41:22,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1386 events. 32/1386 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3033 event pairs, 0 based on Foata normal form. 31/1354 useless extension candidates. Maximal degree in co-relation 1682. Up to 160 conditions per place. [2025-01-09 21:41:22,875 INFO L140 encePairwiseOnDemand]: 1143/1149 looper letters, 38 selfloop transitions, 1 changer transitions 24/282 dead transitions. [2025-01-09 21:41:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 282 transitions, 830 flow [2025-01-09 21:41:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2728 transitions. [2025-01-09 21:41:22,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914128227444154 [2025-01-09 21:41:22,876 INFO L175 Difference]: Start difference. First operand has 351 places, 287 transitions, 758 flow. Second operand 3 states and 2728 transitions. [2025-01-09 21:41:22,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 282 transitions, 830 flow [2025-01-09 21:41:22,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 282 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:22,879 INFO L231 Difference]: Finished difference. Result has 345 places, 258 transitions, 696 flow [2025-01-09 21:41:22,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1149, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=345, PETRI_TRANSITIONS=258} [2025-01-09 21:41:22,880 INFO L279 CegarLoopForPetriNet]: 351 programPoint places, -6 predicate places. [2025-01-09 21:41:22,880 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 258 transitions, 696 flow [2025-01-09 21:41:22,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 895.0) internal successors, (2685), 3 states have internal predecessors, (2685), 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:41:22,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:22,880 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:22,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-01-09 21:41:22,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:22,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1642579871, now seen corresponding path program 1 times [2025-01-09 21:41:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299424415] [2025-01-09 21:41:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:22,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 21:41:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 21:41:22,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:22,989 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:41:22,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299424415] [2025-01-09 21:41:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299424415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737132232] [2025-01-09 21:41:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:22,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:22,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:22,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:23,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1149 [2025-01-09 21:41:23,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 258 transitions, 696 flow. Second operand has 4 states, 4 states have (on average 997.0) internal successors, (3988), 4 states have internal predecessors, (3988), 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:41:23,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:23,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1149 [2025-01-09 21:41:23,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:23,187 INFO L124 PetriNetUnfolderBase]: 0/641 cut-off events. [2025-01-09 21:41:23,188 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES. [2025-01-09 21:41:23,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 641 events. 0/641 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 359 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 0. Up to 33 conditions per place. [2025-01-09 21:41:23,188 INFO L140 encePairwiseOnDemand]: 1145/1149 looper letters, 34 selfloop transitions, 3 changer transitions 0/257 dead transitions. [2025-01-09 21:41:23,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 257 transitions, 768 flow [2025-01-09 21:41:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3990 transitions. [2025-01-09 21:41:23,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681462140992167 [2025-01-09 21:41:23,190 INFO L175 Difference]: Start difference. First operand has 345 places, 258 transitions, 696 flow. Second operand 4 states and 3990 transitions. [2025-01-09 21:41:23,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 257 transitions, 768 flow [2025-01-09 21:41:23,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 257 transitions, 767 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:23,193 INFO L231 Difference]: Finished difference. Result has 322 places, 257 transitions, 699 flow [2025-01-09 21:41:23,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1149, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=699, PETRI_PLACES=322, PETRI_TRANSITIONS=257} [2025-01-09 21:41:23,194 INFO L279 CegarLoopForPetriNet]: 351 programPoint places, -29 predicate places. [2025-01-09 21:41:23,194 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 257 transitions, 699 flow [2025-01-09 21:41:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 997.0) internal successors, (3988), 4 states have internal predecessors, (3988), 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:41:23,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:23,195 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-01-09 21:41:23,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 193115551, now seen corresponding path program 1 times [2025-01-09 21:41:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474791125] [2025-01-09 21:41:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:23,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 21:41:23,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 21:41:23,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:23,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 21:41:23,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 21:41:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:23,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:23,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-01-09 21:41:23,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-01-09 21:41:23,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-01-09 21:41:23,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-01-09 21:41:23,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-01-09 21:41:23,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-01-09 21:41:23,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-01-09 21:41:23,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-01-09 21:41:23,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-01-09 21:41:23,318 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:23,318 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:23,318 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-01-09 21:41:23,418 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:23,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1215 places, 1185 transitions, 4478 flow [2025-01-09 21:41:23,683 INFO L124 PetriNetUnfolderBase]: 130/2044 cut-off events. [2025-01-09 21:41:23,684 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2025-01-09 21:41:23,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 2044 events. 130/2044 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5799 event pairs, 0 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 2635. Up to 64 conditions per place. [2025-01-09 21:41:23,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 1215 places, 1185 transitions, 4478 flow [2025-01-09 21:41:23,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 360 places, 298 transitions, 1653 flow [2025-01-09 21:41:23,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:23,710 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:23,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 21:41:23,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:23,711 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:23,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:23,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:23,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:23,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 187241388, now seen corresponding path program 1 times [2025-01-09 21:41:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606732040] [2025-01-09 21:41:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:23,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:23,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:23,731 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:41:23,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:23,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606732040] [2025-01-09 21:41:23,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606732040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:23,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:23,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959938511] [2025-01-09 21:41:23,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:23,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:23,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:23,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1185 [2025-01-09 21:41:23,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 298 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:41:23,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:23,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1185 [2025-01-09 21:41:23,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:24,153 INFO L124 PetriNetUnfolderBase]: 65/1594 cut-off events. [2025-01-09 21:41:24,153 INFO L125 PetriNetUnfolderBase]: For 5953/5953 co-relation queries the response was YES. [2025-01-09 21:41:24,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 1594 events. 65/1594 cut-off events. For 5953/5953 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4178 event pairs, 32 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 2325. Up to 230 conditions per place. [2025-01-09 21:41:24,172 INFO L140 encePairwiseOnDemand]: 1180/1185 looper letters, 41 selfloop transitions, 2 changer transitions 1/295 dead transitions. [2025-01-09 21:41:24,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 295 transitions, 1733 flow [2025-01-09 21:41:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3004 transitions. [2025-01-09 21:41:24,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450070323488045 [2025-01-09 21:41:24,173 INFO L175 Difference]: Start difference. First operand has 360 places, 298 transitions, 1653 flow. Second operand 3 states and 3004 transitions. [2025-01-09 21:41:24,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 295 transitions, 1733 flow [2025-01-09 21:41:24,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 295 transitions, 862 flow, removed 435 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:24,183 INFO L231 Difference]: Finished difference. Result has 360 places, 294 transitions, 778 flow [2025-01-09 21:41:24,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1185, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=360, PETRI_TRANSITIONS=294} [2025-01-09 21:41:24,183 INFO L279 CegarLoopForPetriNet]: 360 programPoint places, 0 predicate places. [2025-01-09 21:41:24,183 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 294 transitions, 778 flow [2025-01-09 21:41:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:41:24,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:24,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-01-09 21:41:24,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1034311579, now seen corresponding path program 1 times [2025-01-09 21:41:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626221575] [2025-01-09 21:41:24,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:24,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:24,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:24,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:24,207 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:41:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626221575] [2025-01-09 21:41:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626221575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351033705] [2025-01-09 21:41:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:24,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:24,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:24,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:24,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 922 out of 1185 [2025-01-09 21:41:24,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 294 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 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:41:24,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:24,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 922 of 1185 [2025-01-09 21:41:24,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:24,503 INFO L124 PetriNetUnfolderBase]: 33/1430 cut-off events. [2025-01-09 21:41:24,504 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2025-01-09 21:41:24,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 1430 events. 33/1430 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3102 event pairs, 0 based on Foata normal form. 32/1397 useless extension candidates. Maximal degree in co-relation 1736. Up to 165 conditions per place. [2025-01-09 21:41:24,519 INFO L140 encePairwiseOnDemand]: 1179/1185 looper letters, 39 selfloop transitions, 1 changer transitions 24/289 dead transitions. [2025-01-09 21:41:24,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 289 transitions, 852 flow [2025-01-09 21:41:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2813 transitions. [2025-01-09 21:41:24,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7912798874824192 [2025-01-09 21:41:24,520 INFO L175 Difference]: Start difference. First operand has 360 places, 294 transitions, 778 flow. Second operand 3 states and 2813 transitions. [2025-01-09 21:41:24,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 289 transitions, 852 flow [2025-01-09 21:41:24,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 289 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:24,523 INFO L231 Difference]: Finished difference. Result has 354 places, 265 transitions, 716 flow [2025-01-09 21:41:24,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1185, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=354, PETRI_TRANSITIONS=265} [2025-01-09 21:41:24,524 INFO L279 CegarLoopForPetriNet]: 360 programPoint places, -6 predicate places. [2025-01-09 21:41:24,524 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 265 transitions, 716 flow [2025-01-09 21:41:24,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 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:41:24,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:24,525 INFO L206 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-01-09 21:41:24,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:24,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash -817767930, now seen corresponding path program 1 times [2025-01-09 21:41:24,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:24,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030966583] [2025-01-09 21:41:24,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:24,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-01-09 21:41:24,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-01-09 21:41:24,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:24,606 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:41:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030966583] [2025-01-09 21:41:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030966583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:24,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054733882] [2025-01-09 21:41:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:24,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:24,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:24,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1019 out of 1185 [2025-01-09 21:41:24,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 265 transitions, 716 flow. Second operand has 4 states, 4 states have (on average 1028.25) internal successors, (4113), 4 states have internal predecessors, (4113), 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:41:24,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:24,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1019 of 1185 [2025-01-09 21:41:24,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:24,781 INFO L124 PetriNetUnfolderBase]: 0/661 cut-off events. [2025-01-09 21:41:24,781 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-01-09 21:41:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 661 events. 0/661 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 372 event pairs, 0 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 0. Up to 34 conditions per place. [2025-01-09 21:41:24,782 INFO L140 encePairwiseOnDemand]: 1181/1185 looper letters, 35 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2025-01-09 21:41:24,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 264 transitions, 790 flow [2025-01-09 21:41:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4115 transitions. [2025-01-09 21:41:24,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681434599156118 [2025-01-09 21:41:24,784 INFO L175 Difference]: Start difference. First operand has 354 places, 265 transitions, 716 flow. Second operand 4 states and 4115 transitions. [2025-01-09 21:41:24,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 264 transitions, 790 flow [2025-01-09 21:41:24,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 264 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:24,786 INFO L231 Difference]: Finished difference. Result has 331 places, 264 transitions, 719 flow [2025-01-09 21:41:24,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1185, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=331, PETRI_TRANSITIONS=264} [2025-01-09 21:41:24,787 INFO L279 CegarLoopForPetriNet]: 360 programPoint places, -29 predicate places. [2025-01-09 21:41:24,787 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 264 transitions, 719 flow [2025-01-09 21:41:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1028.25) internal successors, (4113), 4 states have internal predecessors, (4113), 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:41:24,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:24,788 INFO L206 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-01-09 21:41:24,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:24,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1087984007, now seen corresponding path program 1 times [2025-01-09 21:41:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104190435] [2025-01-09 21:41:24,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:24,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 21:41:24,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 21:41:24,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:24,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 21:41:24,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 21:41:24,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:24,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:24,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-01-09 21:41:24,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-01-09 21:41:24,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-01-09 21:41:24,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-01-09 21:41:24,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-01-09 21:41:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-01-09 21:41:24,922 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:24,922 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:24,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-01-09 21:41:25,037 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:25,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1252 places, 1221 transitions, 4682 flow [2025-01-09 21:41:25,318 INFO L124 PetriNetUnfolderBase]: 134/2107 cut-off events. [2025-01-09 21:41:25,319 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2025-01-09 21:41:25,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 2107 events. 134/2107 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6103 event pairs, 0 based on Foata normal form. 0/1870 useless extension candidates. Maximal degree in co-relation 2733. Up to 66 conditions per place. [2025-01-09 21:41:25,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 1252 places, 1221 transitions, 4682 flow [2025-01-09 21:41:25,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 305 transitions, 1733 flow [2025-01-09 21:41:25,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:25,347 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:25,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 21:41:25,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:25,347 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:25,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:25,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:25,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:25,348 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:41:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 985561100, now seen corresponding path program 1 times [2025-01-09 21:41:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385862366] [2025-01-09 21:41:25,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:25,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:25,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:25,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:25,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:25,370 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:41:25,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385862366] [2025-01-09 21:41:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385862366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126863805] [2025-01-09 21:41:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:25,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:25,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:25,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:25,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1016 out of 1221 [2025-01-09 21:41:25,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 305 transitions, 1733 flow. Second operand has 3 states, 3 states have (on average 1017.3333333333334) internal successors, (3052), 3 states have internal predecessors, (3052), 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:41:25,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:25,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1016 of 1221 [2025-01-09 21:41:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:25,799 INFO L124 PetriNetUnfolderBase]: 67/1643 cut-off events. [2025-01-09 21:41:25,799 INFO L125 PetriNetUnfolderBase]: For 6513/6513 co-relation queries the response was YES. [2025-01-09 21:41:25,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1643 events. 67/1643 cut-off events. For 6513/6513 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4332 event pairs, 33 based on Foata normal form. 1/1507 useless extension candidates. Maximal degree in co-relation 2415. Up to 237 conditions per place. [2025-01-09 21:41:25,813 INFO L140 encePairwiseOnDemand]: 1216/1221 looper letters, 42 selfloop transitions, 2 changer transitions 1/302 dead transitions. [2025-01-09 21:41:25,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 302 transitions, 1815 flow [2025-01-09 21:41:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3095 transitions. [2025-01-09 21:41:25,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.844935844935845 [2025-01-09 21:41:25,814 INFO L175 Difference]: Start difference. First operand has 369 places, 305 transitions, 1733 flow. Second operand 3 states and 3095 transitions. [2025-01-09 21:41:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 302 transitions, 1815 flow [2025-01-09 21:41:25,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 302 transitions, 884 flow, removed 465 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:25,823 INFO L231 Difference]: Finished difference. Result has 369 places, 301 transitions, 798 flow [2025-01-09 21:41:25,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1221, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=369, PETRI_TRANSITIONS=301} [2025-01-09 21:41:25,823 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, 0 predicate places. [2025-01-09 21:41:25,823 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 301 transitions, 798 flow [2025-01-09 21:41:25,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1017.3333333333334) internal successors, (3052), 3 states have internal predecessors, (3052), 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:41:25,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:25,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-01-09 21:41:25,824 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:41:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 475523114, now seen corresponding path program 1 times [2025-01-09 21:41:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:25,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416133770] [2025-01-09 21:41:25,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:25,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:25,847 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:41:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416133770] [2025-01-09 21:41:25,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416133770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:25,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:25,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363981812] [2025-01-09 21:41:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:25,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:25,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:25,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 950 out of 1221 [2025-01-09 21:41:25,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 301 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 951.0) internal successors, (2853), 3 states have internal predecessors, (2853), 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:41:25,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:25,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 950 of 1221 [2025-01-09 21:41:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:26,161 INFO L124 PetriNetUnfolderBase]: 34/1474 cut-off events. [2025-01-09 21:41:26,161 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-01-09 21:41:26,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1474 events. 34/1474 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3201 event pairs, 0 based on Foata normal form. 33/1440 useless extension candidates. Maximal degree in co-relation 1790. Up to 170 conditions per place. [2025-01-09 21:41:26,177 INFO L140 encePairwiseOnDemand]: 1215/1221 looper letters, 40 selfloop transitions, 1 changer transitions 24/296 dead transitions. [2025-01-09 21:41:26,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 296 transitions, 874 flow [2025-01-09 21:41:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2898 transitions. [2025-01-09 21:41:26,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911547911547911 [2025-01-09 21:41:26,178 INFO L175 Difference]: Start difference. First operand has 369 places, 301 transitions, 798 flow. Second operand 3 states and 2898 transitions. [2025-01-09 21:41:26,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 296 transitions, 874 flow [2025-01-09 21:41:26,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 296 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:26,181 INFO L231 Difference]: Finished difference. Result has 363 places, 272 transitions, 736 flow [2025-01-09 21:41:26,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1221, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=363, PETRI_TRANSITIONS=272} [2025-01-09 21:41:26,181 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -6 predicate places. [2025-01-09 21:41:26,182 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 272 transitions, 736 flow [2025-01-09 21:41:26,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 951.0) internal successors, (2853), 3 states have internal predecessors, (2853), 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:41:26,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,182 INFO L206 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:26,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-01-09 21:41:26,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 509443572, now seen corresponding path program 1 times [2025-01-09 21:41:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109179679] [2025-01-09 21:41:26,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:26,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 21:41:26,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 21:41:26,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:26,261 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:41:26,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:26,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109179679] [2025-01-09 21:41:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109179679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:26,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749417939] [2025-01-09 21:41:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:26,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:26,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:26,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:26,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1050 out of 1221 [2025-01-09 21:41:26,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 272 transitions, 736 flow. Second operand has 4 states, 4 states have (on average 1059.5) internal successors, (4238), 4 states have internal predecessors, (4238), 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:41:26,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:26,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1050 of 1221 [2025-01-09 21:41:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:26,430 INFO L124 PetriNetUnfolderBase]: 0/681 cut-off events. [2025-01-09 21:41:26,431 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-01-09 21:41:26,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 681 events. 0/681 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 384 event pairs, 0 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 0. Up to 35 conditions per place. [2025-01-09 21:41:26,432 INFO L140 encePairwiseOnDemand]: 1217/1221 looper letters, 36 selfloop transitions, 3 changer transitions 0/271 dead transitions. [2025-01-09 21:41:26,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 271 transitions, 812 flow [2025-01-09 21:41:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4240 transitions. [2025-01-09 21:41:26,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681408681408681 [2025-01-09 21:41:26,433 INFO L175 Difference]: Start difference. First operand has 363 places, 272 transitions, 736 flow. Second operand 4 states and 4240 transitions. [2025-01-09 21:41:26,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 271 transitions, 812 flow [2025-01-09 21:41:26,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 271 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:26,436 INFO L231 Difference]: Finished difference. Result has 340 places, 271 transitions, 739 flow [2025-01-09 21:41:26,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1221, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=271} [2025-01-09 21:41:26,436 INFO L279 CegarLoopForPetriNet]: 369 programPoint places, -29 predicate places. [2025-01-09 21:41:26,436 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 271 transitions, 739 flow [2025-01-09 21:41:26,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1059.5) internal successors, (4238), 4 states have internal predecessors, (4238), 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:41:26,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,437 INFO L206 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-01-09 21:41:26,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1340597274, now seen corresponding path program 1 times [2025-01-09 21:41:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880563461] [2025-01-09 21:41:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 21:41:26,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 21:41:26,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:26,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:26,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 21:41:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 21:41:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:26,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:26,576 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-01-09 21:41:26,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-01-09 21:41:26,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-01-09 21:41:26,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-01-09 21:41:26,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-01-09 21:41:26,578 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:26,579 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:26,579 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-01-09 21:41:26,673 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:26,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1289 places, 1257 transitions, 4890 flow [2025-01-09 21:41:26,966 INFO L124 PetriNetUnfolderBase]: 138/2170 cut-off events. [2025-01-09 21:41:26,966 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2025-01-09 21:41:26,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 2170 events. 138/2170 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6171 event pairs, 0 based on Foata normal form. 0/1926 useless extension candidates. Maximal degree in co-relation 2832. Up to 68 conditions per place. [2025-01-09 21:41:26,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 1289 places, 1257 transitions, 4890 flow [2025-01-09 21:41:26,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 378 places, 312 transitions, 1815 flow [2025-01-09 21:41:26,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:26,995 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:26,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-01-09 21:41:26,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:26,996 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:26,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:26,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:26,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:26,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1015962604, now seen corresponding path program 1 times [2025-01-09 21:41:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104624955] [2025-01-09 21:41:26,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:27,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:27,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:27,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:27,019 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:41:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:27,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104624955] [2025-01-09 21:41:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104624955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:27,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:27,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368242841] [2025-01-09 21:41:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:27,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:27,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:27,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1046 out of 1257 [2025-01-09 21:41:27,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 312 transitions, 1815 flow. Second operand has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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:41:27,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:27,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1046 of 1257 [2025-01-09 21:41:27,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:27,520 INFO L124 PetriNetUnfolderBase]: 69/1692 cut-off events. [2025-01-09 21:41:27,520 INFO L125 PetriNetUnfolderBase]: For 7107/7107 co-relation queries the response was YES. [2025-01-09 21:41:27,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 1692 events. 69/1692 cut-off events. For 7107/7107 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4609 event pairs, 34 based on Foata normal form. 1/1552 useless extension candidates. Maximal degree in co-relation 2506. Up to 244 conditions per place. [2025-01-09 21:41:27,533 INFO L140 encePairwiseOnDemand]: 1252/1257 looper letters, 43 selfloop transitions, 2 changer transitions 1/309 dead transitions. [2025-01-09 21:41:27,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 309 transitions, 1899 flow [2025-01-09 21:41:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3186 transitions. [2025-01-09 21:41:27,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8448687350835322 [2025-01-09 21:41:27,536 INFO L175 Difference]: Start difference. First operand has 378 places, 312 transitions, 1815 flow. Second operand 3 states and 3186 transitions. [2025-01-09 21:41:27,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 309 transitions, 1899 flow [2025-01-09 21:41:27,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 309 transitions, 906 flow, removed 496 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:27,547 INFO L231 Difference]: Finished difference. Result has 378 places, 308 transitions, 818 flow [2025-01-09 21:41:27,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1257, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=378, PETRI_TRANSITIONS=308} [2025-01-09 21:41:27,548 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, 0 predicate places. [2025-01-09 21:41:27,548 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 308 transitions, 818 flow [2025-01-09 21:41:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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:41:27,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:27,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-01-09 21:41:27,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash -70122477, now seen corresponding path program 1 times [2025-01-09 21:41:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-01-09 21:41:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:27,583 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:41:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973109377] [2025-01-09 21:41:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973109377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492611490] [2025-01-09 21:41:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:27,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:27,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:27,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:27,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 978 out of 1257 [2025-01-09 21:41:27,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 308 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 979.0) internal successors, (2937), 3 states have internal predecessors, (2937), 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:41:27,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:27,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 978 of 1257 [2025-01-09 21:41:27,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:28,020 INFO L124 PetriNetUnfolderBase]: 35/1518 cut-off events. [2025-01-09 21:41:28,020 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2025-01-09 21:41:28,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 1518 events. 35/1518 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3403 event pairs, 0 based on Foata normal form. 34/1483 useless extension candidates. Maximal degree in co-relation 1844. Up to 175 conditions per place. [2025-01-09 21:41:28,034 INFO L140 encePairwiseOnDemand]: 1251/1257 looper letters, 41 selfloop transitions, 1 changer transitions 24/303 dead transitions. [2025-01-09 21:41:28,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 303 transitions, 896 flow [2025-01-09 21:41:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2983 transitions. [2025-01-09 21:41:28,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7910368602492708 [2025-01-09 21:41:28,037 INFO L175 Difference]: Start difference. First operand has 378 places, 308 transitions, 818 flow. Second operand 3 states and 2983 transitions. [2025-01-09 21:41:28,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 303 transitions, 896 flow [2025-01-09 21:41:28,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 303 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:28,040 INFO L231 Difference]: Finished difference. Result has 372 places, 279 transitions, 756 flow [2025-01-09 21:41:28,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1257, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=372, PETRI_TRANSITIONS=279} [2025-01-09 21:41:28,041 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -6 predicate places. [2025-01-09 21:41:28,041 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 279 transitions, 756 flow [2025-01-09 21:41:28,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 979.0) internal successors, (2937), 3 states have internal predecessors, (2937), 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:41:28,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:28,042 INFO L206 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-01-09 21:41:28,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1298774121, now seen corresponding path program 1 times [2025-01-09 21:41:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636523755] [2025-01-09 21:41:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:28,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 21:41:28,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 21:41:28,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:28,171 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:41:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636523755] [2025-01-09 21:41:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636523755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072841051] [2025-01-09 21:41:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:28,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:28,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:28,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1081 out of 1257 [2025-01-09 21:41:28,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 279 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 1090.75) internal successors, (4363), 4 states have internal predecessors, (4363), 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:41:28,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:28,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1081 of 1257 [2025-01-09 21:41:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:28,426 INFO L124 PetriNetUnfolderBase]: 0/701 cut-off events. [2025-01-09 21:41:28,426 INFO L125 PetriNetUnfolderBase]: For 625/625 co-relation queries the response was YES. [2025-01-09 21:41:28,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 701 events. 0/701 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 396 event pairs, 0 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 0. Up to 36 conditions per place. [2025-01-09 21:41:28,427 INFO L140 encePairwiseOnDemand]: 1253/1257 looper letters, 37 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2025-01-09 21:41:28,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 278 transitions, 834 flow [2025-01-09 21:41:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4365 transitions. [2025-01-09 21:41:28,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681384248210023 [2025-01-09 21:41:28,430 INFO L175 Difference]: Start difference. First operand has 372 places, 279 transitions, 756 flow. Second operand 4 states and 4365 transitions. [2025-01-09 21:41:28,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 278 transitions, 834 flow [2025-01-09 21:41:28,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 278 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:28,434 INFO L231 Difference]: Finished difference. Result has 349 places, 278 transitions, 759 flow [2025-01-09 21:41:28,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1257, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=759, PETRI_PLACES=349, PETRI_TRANSITIONS=278} [2025-01-09 21:41:28,434 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -29 predicate places. [2025-01-09 21:41:28,434 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 278 transitions, 759 flow [2025-01-09 21:41:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1090.75) internal successors, (4363), 4 states have internal predecessors, (4363), 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:41:28,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:28,435 INFO L206 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-01-09 21:41:28,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1818438312, now seen corresponding path program 1 times [2025-01-09 21:41:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035701825] [2025-01-09 21:41:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:28,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 21:41:28,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 21:41:28,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:28,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 21:41:28,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 21:41:28,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:28,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:28,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2025-01-09 21:41:28,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2025-01-09 21:41:28,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2025-01-09 21:41:28,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-01-09 21:41:28,614 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:28,615 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:28,615 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-01-09 21:41:28,727 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1326 places, 1293 transitions, 5102 flow [2025-01-09 21:41:29,029 INFO L124 PetriNetUnfolderBase]: 142/2233 cut-off events. [2025-01-09 21:41:29,029 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2025-01-09 21:41:29,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 2233 events. 142/2233 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6446 event pairs, 0 based on Foata normal form. 0/1982 useless extension candidates. Maximal degree in co-relation 2932. Up to 70 conditions per place. [2025-01-09 21:41:29,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 1326 places, 1293 transitions, 5102 flow [2025-01-09 21:41:29,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 387 places, 319 transitions, 1899 flow [2025-01-09 21:41:29,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:29,059 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:29,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-09 21:41:29,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:29,060 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:29,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:29,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:29,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:29,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 278445900, now seen corresponding path program 1 times [2025-01-09 21:41:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190725786] [2025-01-09 21:41:29,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:29,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:29,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:29,084 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:41:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190725786] [2025-01-09 21:41:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190725786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564694883] [2025-01-09 21:41:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:29,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:29,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:29,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:29,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1293 [2025-01-09 21:41:29,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 319 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:41:29,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:29,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1293 [2025-01-09 21:41:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:29,455 INFO L124 PetriNetUnfolderBase]: 71/1741 cut-off events. [2025-01-09 21:41:29,455 INFO L125 PetriNetUnfolderBase]: For 7736/7736 co-relation queries the response was YES. [2025-01-09 21:41:29,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 1741 events. 71/1741 cut-off events. For 7736/7736 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4746 event pairs, 35 based on Foata normal form. 1/1597 useless extension candidates. Maximal degree in co-relation 2598. Up to 251 conditions per place. [2025-01-09 21:41:29,474 INFO L140 encePairwiseOnDemand]: 1288/1293 looper letters, 44 selfloop transitions, 2 changer transitions 1/316 dead transitions. [2025-01-09 21:41:29,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 316 transitions, 1985 flow [2025-01-09 21:41:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3277 transitions. [2025-01-09 21:41:29,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8448053622067543 [2025-01-09 21:41:29,476 INFO L175 Difference]: Start difference. First operand has 387 places, 319 transitions, 1899 flow. Second operand 3 states and 3277 transitions. [2025-01-09 21:41:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 316 transitions, 1985 flow [2025-01-09 21:41:29,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 316 transitions, 928 flow, removed 528 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:29,489 INFO L231 Difference]: Finished difference. Result has 387 places, 315 transitions, 838 flow [2025-01-09 21:41:29,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1293, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=387, PETRI_TRANSITIONS=315} [2025-01-09 21:41:29,489 INFO L279 CegarLoopForPetriNet]: 387 programPoint places, 0 predicate places. [2025-01-09 21:41:29,489 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 315 transitions, 838 flow [2025-01-09 21:41:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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:41:29,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:29,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:29,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-01-09 21:41:29,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1623718944, now seen corresponding path program 1 times [2025-01-09 21:41:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068411602] [2025-01-09 21:41:29,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:29,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:29,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:29,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:29,512 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:41:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068411602] [2025-01-09 21:41:29,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068411602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:29,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:29,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056322619] [2025-01-09 21:41:29,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:29,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:29,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:29,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:29,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1006 out of 1293 [2025-01-09 21:41:29,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 315 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 1007.0) internal successors, (3021), 3 states have internal predecessors, (3021), 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:41:29,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:29,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1006 of 1293 [2025-01-09 21:41:29,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:29,921 INFO L124 PetriNetUnfolderBase]: 36/1562 cut-off events. [2025-01-09 21:41:29,921 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-01-09 21:41:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1562 events. 36/1562 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3503 event pairs, 0 based on Foata normal form. 35/1526 useless extension candidates. Maximal degree in co-relation 1898. Up to 180 conditions per place. [2025-01-09 21:41:29,928 INFO L140 encePairwiseOnDemand]: 1287/1293 looper letters, 42 selfloop transitions, 1 changer transitions 24/310 dead transitions. [2025-01-09 21:41:29,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 310 transitions, 918 flow [2025-01-09 21:41:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3068 transitions. [2025-01-09 21:41:29,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7909254962619232 [2025-01-09 21:41:29,929 INFO L175 Difference]: Start difference. First operand has 387 places, 315 transitions, 838 flow. Second operand 3 states and 3068 transitions. [2025-01-09 21:41:29,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 310 transitions, 918 flow [2025-01-09 21:41:29,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 310 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:29,932 INFO L231 Difference]: Finished difference. Result has 381 places, 286 transitions, 776 flow [2025-01-09 21:41:29,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1293, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=381, PETRI_TRANSITIONS=286} [2025-01-09 21:41:29,933 INFO L279 CegarLoopForPetriNet]: 387 programPoint places, -6 predicate places. [2025-01-09 21:41:29,933 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 286 transitions, 776 flow [2025-01-09 21:41:29,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1007.0) internal successors, (3021), 3 states have internal predecessors, (3021), 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:41:29,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:29,933 INFO L206 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-01-09 21:41:29,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:29,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1840472475, now seen corresponding path program 1 times [2025-01-09 21:41:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392534200] [2025-01-09 21:41:29,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-01-09 21:41:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-01-09 21:41:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:30,020 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:41:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392534200] [2025-01-09 21:41:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392534200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:30,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:30,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31270456] [2025-01-09 21:41:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:30,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:30,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:30,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:30,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1112 out of 1293 [2025-01-09 21:41:30,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 286 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 1122.0) internal successors, (4488), 4 states have internal predecessors, (4488), 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:41:30,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:30,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1112 of 1293 [2025-01-09 21:41:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:30,223 INFO L124 PetriNetUnfolderBase]: 0/721 cut-off events. [2025-01-09 21:41:30,224 INFO L125 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2025-01-09 21:41:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 721 events. 0/721 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 407 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 0. Up to 37 conditions per place. [2025-01-09 21:41:30,224 INFO L140 encePairwiseOnDemand]: 1289/1293 looper letters, 38 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2025-01-09 21:41:30,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 285 transitions, 856 flow [2025-01-09 21:41:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4490 transitions. [2025-01-09 21:41:30,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681361175560711 [2025-01-09 21:41:30,226 INFO L175 Difference]: Start difference. First operand has 381 places, 286 transitions, 776 flow. Second operand 4 states and 4490 transitions. [2025-01-09 21:41:30,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 285 transitions, 856 flow [2025-01-09 21:41:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 285 transitions, 855 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:30,228 INFO L231 Difference]: Finished difference. Result has 358 places, 285 transitions, 779 flow [2025-01-09 21:41:30,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1293, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=358, PETRI_TRANSITIONS=285} [2025-01-09 21:41:30,229 INFO L279 CegarLoopForPetriNet]: 387 programPoint places, -29 predicate places. [2025-01-09 21:41:30,229 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 285 transitions, 779 flow [2025-01-09 21:41:30,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1122.0) internal successors, (4488), 4 states have internal predecessors, (4488), 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:41:30,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:30,229 INFO L206 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-01-09 21:41:30,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:30,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 75701569, now seen corresponding path program 1 times [2025-01-09 21:41:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964873290] [2025-01-09 21:41:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 21:41:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 21:41:30,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:30,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 21:41:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 21:41:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:30,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:30,387 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 42 remaining) [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 42 remaining) [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 42 remaining) [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 42 remaining) [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 42 remaining) [2025-01-09 21:41:30,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 42 remaining) [2025-01-09 21:41:30,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 42 remaining) [2025-01-09 21:41:30,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 42 remaining) [2025-01-09 21:41:30,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-01-09 21:41:30,390 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:30,390 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:30,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2025-01-09 21:41:30,489 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1363 places, 1329 transitions, 5318 flow [2025-01-09 21:41:30,805 INFO L124 PetriNetUnfolderBase]: 146/2296 cut-off events. [2025-01-09 21:41:30,805 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2025-01-09 21:41:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 2296 events. 146/2296 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6699 event pairs, 0 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 3033. Up to 72 conditions per place. [2025-01-09 21:41:30,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 1363 places, 1329 transitions, 5318 flow [2025-01-09 21:41:30,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 326 transitions, 1985 flow [2025-01-09 21:41:30,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:30,840 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:30,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-09 21:41:30,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:30,841 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:30,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:30,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:30,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:30,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:30,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1226989012, now seen corresponding path program 1 times [2025-01-09 21:41:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:30,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098737424] [2025-01-09 21:41:30,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:30,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:30,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:30,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:30,881 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:41:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098737424] [2025-01-09 21:41:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098737424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426434936] [2025-01-09 21:41:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:30,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:30,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:30,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1106 out of 1329 [2025-01-09 21:41:30,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 326 transitions, 1985 flow. Second operand has 3 states, 3 states have (on average 1107.3333333333333) internal successors, (3322), 3 states have internal predecessors, (3322), 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:41:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1106 of 1329 [2025-01-09 21:41:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:31,277 INFO L124 PetriNetUnfolderBase]: 73/1790 cut-off events. [2025-01-09 21:41:31,278 INFO L125 PetriNetUnfolderBase]: For 8401/8401 co-relation queries the response was YES. [2025-01-09 21:41:31,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1790 events. 73/1790 cut-off events. For 8401/8401 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4880 event pairs, 36 based on Foata normal form. 1/1642 useless extension candidates. Maximal degree in co-relation 2691. Up to 258 conditions per place. [2025-01-09 21:41:31,298 INFO L140 encePairwiseOnDemand]: 1324/1329 looper letters, 45 selfloop transitions, 2 changer transitions 1/323 dead transitions. [2025-01-09 21:41:31,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 323 transitions, 2073 flow [2025-01-09 21:41:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3368 transitions. [2025-01-09 21:41:31,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447454226235265 [2025-01-09 21:41:31,300 INFO L175 Difference]: Start difference. First operand has 396 places, 326 transitions, 1985 flow. Second operand 3 states and 3368 transitions. [2025-01-09 21:41:31,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 323 transitions, 2073 flow [2025-01-09 21:41:31,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 323 transitions, 950 flow, removed 561 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:31,311 INFO L231 Difference]: Finished difference. Result has 396 places, 322 transitions, 858 flow [2025-01-09 21:41:31,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1329, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=396, PETRI_TRANSITIONS=322} [2025-01-09 21:41:31,312 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, 0 predicate places. [2025-01-09 21:41:31,312 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 322 transitions, 858 flow [2025-01-09 21:41:31,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1107.3333333333333) internal successors, (3322), 3 states have internal predecessors, (3322), 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:41:31,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:31,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:31,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-01-09 21:41:31,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:31,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1262080081, now seen corresponding path program 1 times [2025-01-09 21:41:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361571358] [2025-01-09 21:41:31,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:31,338 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:41:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361571358] [2025-01-09 21:41:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361571358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021584233] [2025-01-09 21:41:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:31,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1329 [2025-01-09 21:41:31,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 322 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 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:41:31,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:31,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1329 [2025-01-09 21:41:31,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:31,662 INFO L124 PetriNetUnfolderBase]: 37/1606 cut-off events. [2025-01-09 21:41:31,663 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2025-01-09 21:41:31,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 1606 events. 37/1606 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3605 event pairs, 0 based on Foata normal form. 36/1569 useless extension candidates. Maximal degree in co-relation 1952. Up to 185 conditions per place. [2025-01-09 21:41:31,678 INFO L140 encePairwiseOnDemand]: 1323/1329 looper letters, 43 selfloop transitions, 1 changer transitions 24/317 dead transitions. [2025-01-09 21:41:31,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 317 transitions, 940 flow [2025-01-09 21:41:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3153 transitions. [2025-01-09 21:41:31,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7908201655379985 [2025-01-09 21:41:31,680 INFO L175 Difference]: Start difference. First operand has 396 places, 322 transitions, 858 flow. Second operand 3 states and 3153 transitions. [2025-01-09 21:41:31,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 317 transitions, 940 flow [2025-01-09 21:41:31,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 317 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:31,683 INFO L231 Difference]: Finished difference. Result has 390 places, 293 transitions, 796 flow [2025-01-09 21:41:31,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1329, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=390, PETRI_TRANSITIONS=293} [2025-01-09 21:41:31,683 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -6 predicate places. [2025-01-09 21:41:31,683 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 293 transitions, 796 flow [2025-01-09 21:41:31,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 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:41:31,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:31,684 INFO L206 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-01-09 21:41:31,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 59987176, now seen corresponding path program 1 times [2025-01-09 21:41:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896978510] [2025-01-09 21:41:31,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:31,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-09 21:41:31,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-09 21:41:31,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:31,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896978510] [2025-01-09 21:41:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896978510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292924680] [2025-01-09 21:41:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:31,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:31,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:31,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:31,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1143 out of 1329 [2025-01-09 21:41:31,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 293 transitions, 796 flow. Second operand has 4 states, 4 states have (on average 1153.25) internal successors, (4613), 4 states have internal predecessors, (4613), 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:41:31,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:31,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1143 of 1329 [2025-01-09 21:41:31,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:32,046 INFO L124 PetriNetUnfolderBase]: 0/741 cut-off events. [2025-01-09 21:41:32,046 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2025-01-09 21:41:32,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 741 events. 0/741 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 419 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 0. Up to 38 conditions per place. [2025-01-09 21:41:32,047 INFO L140 encePairwiseOnDemand]: 1325/1329 looper letters, 39 selfloop transitions, 3 changer transitions 0/292 dead transitions. [2025-01-09 21:41:32,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 292 transitions, 878 flow [2025-01-09 21:41:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4615 transitions. [2025-01-09 21:41:32,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681339352896915 [2025-01-09 21:41:32,049 INFO L175 Difference]: Start difference. First operand has 390 places, 293 transitions, 796 flow. Second operand 4 states and 4615 transitions. [2025-01-09 21:41:32,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 292 transitions, 878 flow [2025-01-09 21:41:32,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 292 transitions, 877 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:32,051 INFO L231 Difference]: Finished difference. Result has 367 places, 292 transitions, 799 flow [2025-01-09 21:41:32,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1329, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=799, PETRI_PLACES=367, PETRI_TRANSITIONS=292} [2025-01-09 21:41:32,052 INFO L279 CegarLoopForPetriNet]: 396 programPoint places, -29 predicate places. [2025-01-09 21:41:32,052 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 292 transitions, 799 flow [2025-01-09 21:41:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1153.25) internal successors, (4613), 4 states have internal predecessors, (4613), 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:41:32,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:32,052 INFO L206 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-01-09 21:41:32,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:32,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 726811605, now seen corresponding path program 1 times [2025-01-09 21:41:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:32,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389177939] [2025-01-09 21:41:32,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:32,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 21:41:32,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 21:41:32,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:32,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 21:41:32,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 21:41:32,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:32,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:32,219 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:32,219 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 43 remaining) [2025-01-09 21:41:32,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2025-01-09 21:41:32,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2025-01-09 21:41:32,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2025-01-09 21:41:32,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2025-01-09 21:41:32,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2025-01-09 21:41:32,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2025-01-09 21:41:32,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 43 remaining) [2025-01-09 21:41:32,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-01-09 21:41:32,222 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:32,222 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:32,222 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2025-01-09 21:41:32,371 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1400 places, 1365 transitions, 5538 flow [2025-01-09 21:41:32,711 INFO L124 PetriNetUnfolderBase]: 150/2359 cut-off events. [2025-01-09 21:41:32,711 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2025-01-09 21:41:32,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 2359 events. 150/2359 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6668 event pairs, 0 based on Foata normal form. 0/2094 useless extension candidates. Maximal degree in co-relation 3135. Up to 74 conditions per place. [2025-01-09 21:41:32,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 1400 places, 1365 transitions, 5538 flow [2025-01-09 21:41:32,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 333 transitions, 2073 flow [2025-01-09 21:41:32,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:32,744 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:32,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 21:41:32,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:32,745 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:32,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:32,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:32,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:32,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:32,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash 794625164, now seen corresponding path program 1 times [2025-01-09 21:41:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61076504] [2025-01-09 21:41:32,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:32,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:32,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:32,773 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:41:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61076504] [2025-01-09 21:41:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61076504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:32,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:32,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:32,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227081406] [2025-01-09 21:41:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:32,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:32,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:32,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:32,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:32,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1136 out of 1365 [2025-01-09 21:41:32,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 333 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 1137.3333333333333) internal successors, (3412), 3 states have internal predecessors, (3412), 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:41:32,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:32,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1136 of 1365 [2025-01-09 21:41:32,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:33,195 INFO L124 PetriNetUnfolderBase]: 75/1839 cut-off events. [2025-01-09 21:41:33,196 INFO L125 PetriNetUnfolderBase]: For 9103/9103 co-relation queries the response was YES. [2025-01-09 21:41:33,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 1839 events. 75/1839 cut-off events. For 9103/9103 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5224 event pairs, 37 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 2785. Up to 265 conditions per place. [2025-01-09 21:41:33,217 INFO L140 encePairwiseOnDemand]: 1360/1365 looper letters, 46 selfloop transitions, 2 changer transitions 1/330 dead transitions. [2025-01-09 21:41:33,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 330 transitions, 2163 flow [2025-01-09 21:41:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3459 transitions. [2025-01-09 21:41:33,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446886446886447 [2025-01-09 21:41:33,219 INFO L175 Difference]: Start difference. First operand has 405 places, 333 transitions, 2073 flow. Second operand 3 states and 3459 transitions. [2025-01-09 21:41:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 330 transitions, 2163 flow [2025-01-09 21:41:33,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 330 transitions, 972 flow, removed 595 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:33,230 INFO L231 Difference]: Finished difference. Result has 405 places, 329 transitions, 878 flow [2025-01-09 21:41:33,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1365, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=405, PETRI_TRANSITIONS=329} [2025-01-09 21:41:33,230 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, 0 predicate places. [2025-01-09 21:41:33,231 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 329 transitions, 878 flow [2025-01-09 21:41:33,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1137.3333333333333) internal successors, (3412), 3 states have internal predecessors, (3412), 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:41:33,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:33,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-01-09 21:41:33,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1155039066, now seen corresponding path program 1 times [2025-01-09 21:41:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-01-09 21:41:33,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:33,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:33,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:33,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:33,262 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:41:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-01-09 21:41:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153887763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:33,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:33,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:33,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242792221] [2025-01-09 21:41:33,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:33,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:33,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:33,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:33,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:33,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1062 out of 1365 [2025-01-09 21:41:33,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 329 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 1063.0) internal successors, (3189), 3 states have internal predecessors, (3189), 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:41:33,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:33,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1062 of 1365 [2025-01-09 21:41:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:33,611 INFO L124 PetriNetUnfolderBase]: 38/1650 cut-off events. [2025-01-09 21:41:33,611 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2025-01-09 21:41:33,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 1650 events. 38/1650 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 3889 event pairs, 0 based on Foata normal form. 37/1612 useless extension candidates. Maximal degree in co-relation 2006. Up to 190 conditions per place. [2025-01-09 21:41:33,627 INFO L140 encePairwiseOnDemand]: 1359/1365 looper letters, 44 selfloop transitions, 1 changer transitions 24/324 dead transitions. [2025-01-09 21:41:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 324 transitions, 962 flow [2025-01-09 21:41:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2025-01-09 21:41:33,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7907203907203907 [2025-01-09 21:41:33,629 INFO L175 Difference]: Start difference. First operand has 405 places, 329 transitions, 878 flow. Second operand 3 states and 3238 transitions. [2025-01-09 21:41:33,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 324 transitions, 962 flow [2025-01-09 21:41:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 324 transitions, 958 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:33,632 INFO L231 Difference]: Finished difference. Result has 399 places, 300 transitions, 816 flow [2025-01-09 21:41:33,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1365, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=399, PETRI_TRANSITIONS=300} [2025-01-09 21:41:33,632 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -6 predicate places. [2025-01-09 21:41:33,632 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 300 transitions, 816 flow [2025-01-09 21:41:33,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1063.0) internal successors, (3189), 3 states have internal predecessors, (3189), 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:41:33,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:33,633 INFO L206 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-01-09 21:41:33,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:33,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2040393486, now seen corresponding path program 1 times [2025-01-09 21:41:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440364527] [2025-01-09 21:41:33,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:33,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-09 21:41:33,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-09 21:41:33,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:33,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:33,722 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:41:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440364527] [2025-01-09 21:41:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440364527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:33,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86029683] [2025-01-09 21:41:33,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:33,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:33,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:33,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:33,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1174 out of 1365 [2025-01-09 21:41:33,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 300 transitions, 816 flow. Second operand has 4 states, 4 states have (on average 1184.5) internal successors, (4738), 4 states have internal predecessors, (4738), 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:41:33,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:33,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1174 of 1365 [2025-01-09 21:41:33,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:33,936 INFO L124 PetriNetUnfolderBase]: 0/761 cut-off events. [2025-01-09 21:41:33,936 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2025-01-09 21:41:33,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 761 events. 0/761 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 432 event pairs, 0 based on Foata normal form. 0/761 useless extension candidates. Maximal degree in co-relation 0. Up to 39 conditions per place. [2025-01-09 21:41:33,937 INFO L140 encePairwiseOnDemand]: 1361/1365 looper letters, 40 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2025-01-09 21:41:33,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 299 transitions, 900 flow [2025-01-09 21:41:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4740 transitions. [2025-01-09 21:41:33,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681318681318682 [2025-01-09 21:41:33,939 INFO L175 Difference]: Start difference. First operand has 399 places, 300 transitions, 816 flow. Second operand 4 states and 4740 transitions. [2025-01-09 21:41:33,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 299 transitions, 900 flow [2025-01-09 21:41:33,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 299 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:33,941 INFO L231 Difference]: Finished difference. Result has 376 places, 299 transitions, 819 flow [2025-01-09 21:41:33,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1365, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=819, PETRI_PLACES=376, PETRI_TRANSITIONS=299} [2025-01-09 21:41:33,942 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -29 predicate places. [2025-01-09 21:41:33,942 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 299 transitions, 819 flow [2025-01-09 21:41:33,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1184.5) internal successors, (4738), 4 states have internal predecessors, (4738), 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:41:33,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:33,942 INFO L206 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-01-09 21:41:33,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -193044204, now seen corresponding path program 1 times [2025-01-09 21:41:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505300588] [2025-01-09 21:41:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:33,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 21:41:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 21:41:33,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:33,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:33,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:33,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 21:41:34,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 21:41:34,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:34,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:34,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:34,218 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-01-09 21:41:34,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-01-09 21:41:34,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-01-09 21:41:34,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-01-09 21:41:34,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-01-09 21:41:34,220 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:34,221 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:34,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2025-01-09 21:41:34,318 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:34,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1437 places, 1401 transitions, 5762 flow [2025-01-09 21:41:34,669 INFO L124 PetriNetUnfolderBase]: 154/2422 cut-off events. [2025-01-09 21:41:34,670 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2025-01-09 21:41:34,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 2422 events. 154/2422 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6937 event pairs, 0 based on Foata normal form. 0/2150 useless extension candidates. Maximal degree in co-relation 3238. Up to 76 conditions per place. [2025-01-09 21:41:34,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 1437 places, 1401 transitions, 5762 flow [2025-01-09 21:41:34,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 340 transitions, 2163 flow [2025-01-09 21:41:34,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:34,705 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:34,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-01-09 21:41:34,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:34,706 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:34,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:34,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:34,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:34,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2048321132, now seen corresponding path program 1 times [2025-01-09 21:41:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56004498] [2025-01-09 21:41:34,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:34,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:34,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:34,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:34,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:34,737 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:41:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56004498] [2025-01-09 21:41:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56004498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010286285] [2025-01-09 21:41:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:34,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1166 out of 1401 [2025-01-09 21:41:34,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 340 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1167.3333333333333) internal successors, (3502), 3 states have internal predecessors, (3502), 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:41:34,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:34,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1166 of 1401 [2025-01-09 21:41:34,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:35,159 INFO L124 PetriNetUnfolderBase]: 77/1888 cut-off events. [2025-01-09 21:41:35,159 INFO L125 PetriNetUnfolderBase]: For 9843/9843 co-relation queries the response was YES. [2025-01-09 21:41:35,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1888 events. 77/1888 cut-off events. For 9843/9843 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5195 event pairs, 38 based on Foata normal form. 1/1732 useless extension candidates. Maximal degree in co-relation 2880. Up to 272 conditions per place. [2025-01-09 21:41:35,183 INFO L140 encePairwiseOnDemand]: 1396/1401 looper letters, 47 selfloop transitions, 2 changer transitions 1/337 dead transitions. [2025-01-09 21:41:35,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 337 transitions, 2255 flow [2025-01-09 21:41:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3550 transitions. [2025-01-09 21:41:35,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446347846776112 [2025-01-09 21:41:35,184 INFO L175 Difference]: Start difference. First operand has 414 places, 340 transitions, 2163 flow. Second operand 3 states and 3550 transitions. [2025-01-09 21:41:35,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 337 transitions, 2255 flow [2025-01-09 21:41:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 337 transitions, 994 flow, removed 630 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:35,196 INFO L231 Difference]: Finished difference. Result has 414 places, 336 transitions, 898 flow [2025-01-09 21:41:35,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1401, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=414, PETRI_TRANSITIONS=336} [2025-01-09 21:41:35,197 INFO L279 CegarLoopForPetriNet]: 414 programPoint places, 0 predicate places. [2025-01-09 21:41:35,197 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 336 transitions, 898 flow [2025-01-09 21:41:35,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1167.3333333333333) internal successors, (3502), 3 states have internal predecessors, (3502), 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:41:35,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:35,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:35,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-01-09 21:41:35,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1332671201, now seen corresponding path program 1 times [2025-01-09 21:41:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-01-09 21:41:35,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:35,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:35,227 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:41:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-01-09 21:41:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503196257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190211552] [2025-01-09 21:41:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:35,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:35,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1401 [2025-01-09 21:41:35,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 336 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 1091.0) internal successors, (3273), 3 states have internal predecessors, (3273), 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:41:35,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:35,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1401 [2025-01-09 21:41:35,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:35,591 INFO L124 PetriNetUnfolderBase]: 39/1694 cut-off events. [2025-01-09 21:41:35,591 INFO L125 PetriNetUnfolderBase]: For 776/776 co-relation queries the response was YES. [2025-01-09 21:41:35,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1694 events. 39/1694 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3847 event pairs, 0 based on Foata normal form. 38/1655 useless extension candidates. Maximal degree in co-relation 2060. Up to 195 conditions per place. [2025-01-09 21:41:35,609 INFO L140 encePairwiseOnDemand]: 1395/1401 looper letters, 45 selfloop transitions, 1 changer transitions 24/331 dead transitions. [2025-01-09 21:41:35,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 331 transitions, 984 flow [2025-01-09 21:41:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3323 transitions. [2025-01-09 21:41:35,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7906257435165358 [2025-01-09 21:41:35,610 INFO L175 Difference]: Start difference. First operand has 414 places, 336 transitions, 898 flow. Second operand 3 states and 3323 transitions. [2025-01-09 21:41:35,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 331 transitions, 984 flow [2025-01-09 21:41:35,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 331 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:35,613 INFO L231 Difference]: Finished difference. Result has 408 places, 307 transitions, 836 flow [2025-01-09 21:41:35,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1401, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=408, PETRI_TRANSITIONS=307} [2025-01-09 21:41:35,614 INFO L279 CegarLoopForPetriNet]: 414 programPoint places, -6 predicate places. [2025-01-09 21:41:35,614 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 307 transitions, 836 flow [2025-01-09 21:41:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.0) internal successors, (3273), 3 states have internal predecessors, (3273), 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:41:35,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:35,614 INFO L206 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-01-09 21:41:35,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:35,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash 23336835, now seen corresponding path program 1 times [2025-01-09 21:41:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264153632] [2025-01-09 21:41:35,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:35,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-09 21:41:35,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-09 21:41:35,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:35,705 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:41:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264153632] [2025-01-09 21:41:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264153632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120912384] [2025-01-09 21:41:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:35,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:35,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:35,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:35,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:35,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1205 out of 1401 [2025-01-09 21:41:35,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 307 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 1215.75) internal successors, (4863), 4 states have internal predecessors, (4863), 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:41:35,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:35,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1205 of 1401 [2025-01-09 21:41:35,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:35,916 INFO L124 PetriNetUnfolderBase]: 0/781 cut-off events. [2025-01-09 21:41:35,916 INFO L125 PetriNetUnfolderBase]: For 775/775 co-relation queries the response was YES. [2025-01-09 21:41:35,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 781 events. 0/781 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 443 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 0. Up to 40 conditions per place. [2025-01-09 21:41:35,916 INFO L140 encePairwiseOnDemand]: 1397/1401 looper letters, 41 selfloop transitions, 3 changer transitions 0/306 dead transitions. [2025-01-09 21:41:35,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 306 transitions, 922 flow [2025-01-09 21:41:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4865 transitions. [2025-01-09 21:41:35,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681299072091363 [2025-01-09 21:41:35,918 INFO L175 Difference]: Start difference. First operand has 408 places, 307 transitions, 836 flow. Second operand 4 states and 4865 transitions. [2025-01-09 21:41:35,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 306 transitions, 922 flow [2025-01-09 21:41:35,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 306 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:35,921 INFO L231 Difference]: Finished difference. Result has 385 places, 306 transitions, 839 flow [2025-01-09 21:41:35,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1401, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=839, PETRI_PLACES=385, PETRI_TRANSITIONS=306} [2025-01-09 21:41:35,921 INFO L279 CegarLoopForPetriNet]: 414 programPoint places, -29 predicate places. [2025-01-09 21:41:35,922 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 306 transitions, 839 flow [2025-01-09 21:41:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1215.75) internal successors, (4863), 4 states have internal predecessors, (4863), 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:41:35,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:35,922 INFO L206 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-01-09 21:41:35,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:35,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1690836222, now seen corresponding path program 1 times [2025-01-09 21:41:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:35,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168172313] [2025-01-09 21:41:35,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 21:41:35,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 21:41:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:35,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:35,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 21:41:35,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 21:41:35,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:36,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:36,114 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:36,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-01-09 21:41:36,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-01-09 21:41:36,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-01-09 21:41:36,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-01-09 21:41:36,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-01-09 21:41:36,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-01-09 21:41:36,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-01-09 21:41:36,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-01-09 21:41:36,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-01-09 21:41:36,217 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:36,217 WARN L246 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:36,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2025-01-09 21:41:36,342 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:36,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1474 places, 1437 transitions, 5990 flow [2025-01-09 21:41:36,906 INFO L124 PetriNetUnfolderBase]: 158/2485 cut-off events. [2025-01-09 21:41:36,906 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2025-01-09 21:41:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 2485 events. 158/2485 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7264 event pairs, 0 based on Foata normal form. 0/2206 useless extension candidates. Maximal degree in co-relation 3342. Up to 78 conditions per place. [2025-01-09 21:41:36,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 1474 places, 1437 transitions, 5990 flow [2025-01-09 21:41:36,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 423 places, 347 transitions, 2255 flow [2025-01-09 21:41:36,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:36,944 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:36,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:41:36,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:36,945 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:36,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:36,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:36,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:36,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1760868404, now seen corresponding path program 1 times [2025-01-09 21:41:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833665875] [2025-01-09 21:41:36,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:36,991 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:41:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833665875] [2025-01-09 21:41:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833665875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146754818] [2025-01-09 21:41:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:36,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:36,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:37,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1196 out of 1437 [2025-01-09 21:41:37,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 347 transitions, 2255 flow. Second operand has 3 states, 3 states have (on average 1197.3333333333333) internal successors, (3592), 3 states have internal predecessors, (3592), 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:41:37,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:37,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1196 of 1437 [2025-01-09 21:41:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:37,477 INFO L124 PetriNetUnfolderBase]: 79/1937 cut-off events. [2025-01-09 21:41:37,477 INFO L125 PetriNetUnfolderBase]: For 10622/10622 co-relation queries the response was YES. [2025-01-09 21:41:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1937 events. 79/1937 cut-off events. For 10622/10622 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5295 event pairs, 39 based on Foata normal form. 1/1777 useless extension candidates. Maximal degree in co-relation 2976. Up to 279 conditions per place. [2025-01-09 21:41:37,502 INFO L140 encePairwiseOnDemand]: 1432/1437 looper letters, 48 selfloop transitions, 2 changer transitions 1/344 dead transitions. [2025-01-09 21:41:37,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 344 transitions, 2349 flow [2025-01-09 21:41:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3641 transitions. [2025-01-09 21:41:37,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445836232892601 [2025-01-09 21:41:37,503 INFO L175 Difference]: Start difference. First operand has 423 places, 347 transitions, 2255 flow. Second operand 3 states and 3641 transitions. [2025-01-09 21:41:37,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 344 transitions, 2349 flow [2025-01-09 21:41:37,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 344 transitions, 1016 flow, removed 666 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:37,516 INFO L231 Difference]: Finished difference. Result has 423 places, 343 transitions, 918 flow [2025-01-09 21:41:37,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1437, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=423, PETRI_TRANSITIONS=343} [2025-01-09 21:41:37,517 INFO L279 CegarLoopForPetriNet]: 423 programPoint places, 0 predicate places. [2025-01-09 21:41:37,517 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 343 transitions, 918 flow [2025-01-09 21:41:37,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1197.3333333333333) internal successors, (3592), 3 states have internal predecessors, (3592), 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:41:37,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:37,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:37,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-01-09 21:41:37,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:37,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:37,518 INFO L85 PathProgramCache]: Analyzing trace with hash 729183676, now seen corresponding path program 1 times [2025-01-09 21:41:37,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:37,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764403] [2025-01-09 21:41:37,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:37,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:37,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:37,548 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:41:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764403] [2025-01-09 21:41:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987202881] [2025-01-09 21:41:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:37,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:37,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:37,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:37,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1437 [2025-01-09 21:41:37,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 343 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 1119.0) internal successors, (3357), 3 states have internal predecessors, (3357), 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:41:37,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:37,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1437 [2025-01-09 21:41:37,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:37,935 INFO L124 PetriNetUnfolderBase]: 40/1738 cut-off events. [2025-01-09 21:41:37,936 INFO L125 PetriNetUnfolderBase]: For 816/816 co-relation queries the response was YES. [2025-01-09 21:41:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 1738 events. 40/1738 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3911 event pairs, 0 based on Foata normal form. 39/1698 useless extension candidates. Maximal degree in co-relation 2114. Up to 200 conditions per place. [2025-01-09 21:41:37,954 INFO L140 encePairwiseOnDemand]: 1431/1437 looper letters, 46 selfloop transitions, 1 changer transitions 24/338 dead transitions. [2025-01-09 21:41:37,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 338 transitions, 1006 flow [2025-01-09 21:41:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3408 transitions. [2025-01-09 21:41:37,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905358385525401 [2025-01-09 21:41:37,956 INFO L175 Difference]: Start difference. First operand has 423 places, 343 transitions, 918 flow. Second operand 3 states and 3408 transitions. [2025-01-09 21:41:37,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 338 transitions, 1006 flow [2025-01-09 21:41:37,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 338 transitions, 1002 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:37,959 INFO L231 Difference]: Finished difference. Result has 417 places, 314 transitions, 856 flow [2025-01-09 21:41:37,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1437, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=417, PETRI_TRANSITIONS=314} [2025-01-09 21:41:37,959 INFO L279 CegarLoopForPetriNet]: 423 programPoint places, -6 predicate places. [2025-01-09 21:41:37,959 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 314 transitions, 856 flow [2025-01-09 21:41:37,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1119.0) internal successors, (3357), 3 states have internal predecessors, (3357), 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:41:37,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:37,960 INFO L206 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:37,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-01-09 21:41:37,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -725893733, now seen corresponding path program 1 times [2025-01-09 21:41:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713954840] [2025-01-09 21:41:37,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-01-09 21:41:37,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-01-09 21:41:37,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:37,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:38,056 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:41:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:38,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713954840] [2025-01-09 21:41:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713954840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:38,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154343450] [2025-01-09 21:41:38,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:38,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1236 out of 1437 [2025-01-09 21:41:38,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 314 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 1247.0) internal successors, (4988), 4 states have internal predecessors, (4988), 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:41:38,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:38,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1236 of 1437 [2025-01-09 21:41:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:38,297 INFO L124 PetriNetUnfolderBase]: 0/801 cut-off events. [2025-01-09 21:41:38,297 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2025-01-09 21:41:38,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 801 events. 0/801 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 455 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 0. Up to 41 conditions per place. [2025-01-09 21:41:38,298 INFO L140 encePairwiseOnDemand]: 1433/1437 looper letters, 42 selfloop transitions, 3 changer transitions 0/313 dead transitions. [2025-01-09 21:41:38,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 313 transitions, 944 flow [2025-01-09 21:41:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4990 transitions. [2025-01-09 21:41:38,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681280445372304 [2025-01-09 21:41:38,300 INFO L175 Difference]: Start difference. First operand has 417 places, 314 transitions, 856 flow. Second operand 4 states and 4990 transitions. [2025-01-09 21:41:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 313 transitions, 944 flow [2025-01-09 21:41:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 313 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:38,303 INFO L231 Difference]: Finished difference. Result has 394 places, 313 transitions, 859 flow [2025-01-09 21:41:38,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1437, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=859, PETRI_PLACES=394, PETRI_TRANSITIONS=313} [2025-01-09 21:41:38,303 INFO L279 CegarLoopForPetriNet]: 423 programPoint places, -29 predicate places. [2025-01-09 21:41:38,303 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 313 transitions, 859 flow [2025-01-09 21:41:38,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1247.0) internal successors, (4988), 4 states have internal predecessors, (4988), 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:41:38,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:38,304 INFO L206 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-01-09 21:41:38,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:38,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 785166227, now seen corresponding path program 1 times [2025-01-09 21:41:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980834733] [2025-01-09 21:41:38,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:38,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 21:41:38,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 21:41:38,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:38,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:38,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:38,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 21:41:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 21:41:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:38,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:38,507 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:38,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-01-09 21:41:38,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:41:38,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:41:38,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:41:38,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:41:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-01-09 21:41:38,510 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:38,510 WARN L246 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:38,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2025-01-09 21:41:38,612 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:38,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1511 places, 1473 transitions, 6222 flow [2025-01-09 21:41:39,107 INFO L124 PetriNetUnfolderBase]: 162/2548 cut-off events. [2025-01-09 21:41:39,107 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2025-01-09 21:41:39,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 2548 events. 162/2548 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7529 event pairs, 0 based on Foata normal form. 0/2262 useless extension candidates. Maximal degree in co-relation 3447. Up to 80 conditions per place. [2025-01-09 21:41:39,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 1511 places, 1473 transitions, 6222 flow [2025-01-09 21:41:39,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 432 places, 354 transitions, 2349 flow [2025-01-09 21:41:39,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:39,131 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:39,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-09 21:41:39,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:39,132 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:39,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:39,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:39,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:39,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:39,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2043008852, now seen corresponding path program 1 times [2025-01-09 21:41:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:39,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567639973] [2025-01-09 21:41:39,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:39,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:39,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:39,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:39,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:39,163 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:41:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567639973] [2025-01-09 21:41:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567639973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462648133] [2025-01-09 21:41:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:39,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:39,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:39,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:39,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1226 out of 1473 [2025-01-09 21:41:39,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 354 transitions, 2349 flow. Second operand has 3 states, 3 states have (on average 1227.3333333333333) internal successors, (3682), 3 states have internal predecessors, (3682), 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:41:39,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:39,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1226 of 1473 [2025-01-09 21:41:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:39,614 INFO L124 PetriNetUnfolderBase]: 81/1986 cut-off events. [2025-01-09 21:41:39,614 INFO L125 PetriNetUnfolderBase]: For 11441/11441 co-relation queries the response was YES. [2025-01-09 21:41:39,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 1986 events. 81/1986 cut-off events. For 11441/11441 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5449 event pairs, 40 based on Foata normal form. 1/1822 useless extension candidates. Maximal degree in co-relation 3073. Up to 286 conditions per place. [2025-01-09 21:41:39,640 INFO L140 encePairwiseOnDemand]: 1468/1473 looper letters, 49 selfloop transitions, 2 changer transitions 1/351 dead transitions. [2025-01-09 21:41:39,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 351 transitions, 2445 flow [2025-01-09 21:41:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3732 transitions. [2025-01-09 21:41:39,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445349626612356 [2025-01-09 21:41:39,642 INFO L175 Difference]: Start difference. First operand has 432 places, 354 transitions, 2349 flow. Second operand 3 states and 3732 transitions. [2025-01-09 21:41:39,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 351 transitions, 2445 flow [2025-01-09 21:41:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 351 transitions, 1038 flow, removed 703 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:39,655 INFO L231 Difference]: Finished difference. Result has 432 places, 350 transitions, 938 flow [2025-01-09 21:41:39,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1473, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=432, PETRI_TRANSITIONS=350} [2025-01-09 21:41:39,655 INFO L279 CegarLoopForPetriNet]: 432 programPoint places, 0 predicate places. [2025-01-09 21:41:39,655 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 350 transitions, 938 flow [2025-01-09 21:41:39,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1227.3333333333333) internal successors, (3682), 3 states have internal predecessors, (3682), 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:41:39,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:39,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:39,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-01-09 21:41:39,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:39,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 735558269, now seen corresponding path program 1 times [2025-01-09 21:41:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:39,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353667874] [2025-01-09 21:41:39,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:39,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:39,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:39,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:39,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:39,688 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:41:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353667874] [2025-01-09 21:41:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353667874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174060925] [2025-01-09 21:41:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:39,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:39,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:39,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1146 out of 1473 [2025-01-09 21:41:39,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 350 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 1147.0) internal successors, (3441), 3 states have internal predecessors, (3441), 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:41:39,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:39,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1146 of 1473 [2025-01-09 21:41:39,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:40,077 INFO L124 PetriNetUnfolderBase]: 41/1782 cut-off events. [2025-01-09 21:41:40,078 INFO L125 PetriNetUnfolderBase]: For 857/857 co-relation queries the response was YES. [2025-01-09 21:41:40,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 1782 events. 41/1782 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4013 event pairs, 0 based on Foata normal form. 40/1741 useless extension candidates. Maximal degree in co-relation 2168. Up to 205 conditions per place. [2025-01-09 21:41:40,098 INFO L140 encePairwiseOnDemand]: 1467/1473 looper letters, 47 selfloop transitions, 1 changer transitions 24/345 dead transitions. [2025-01-09 21:41:40,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 345 transitions, 1028 flow [2025-01-09 21:41:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3493 transitions. [2025-01-09 21:41:40,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904503281285359 [2025-01-09 21:41:40,099 INFO L175 Difference]: Start difference. First operand has 432 places, 350 transitions, 938 flow. Second operand 3 states and 3493 transitions. [2025-01-09 21:41:40,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 345 transitions, 1028 flow [2025-01-09 21:41:40,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 345 transitions, 1024 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:40,102 INFO L231 Difference]: Finished difference. Result has 426 places, 321 transitions, 876 flow [2025-01-09 21:41:40,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1473, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=426, PETRI_TRANSITIONS=321} [2025-01-09 21:41:40,103 INFO L279 CegarLoopForPetriNet]: 432 programPoint places, -6 predicate places. [2025-01-09 21:41:40,103 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 321 transitions, 876 flow [2025-01-09 21:41:40,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1147.0) internal successors, (3441), 3 states have internal predecessors, (3441), 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:41:40,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:40,103 INFO L206 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-01-09 21:41:40,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1762498502, now seen corresponding path program 1 times [2025-01-09 21:41:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-01-09 21:41:40,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:40,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 21:41:40,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 21:41:40,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:40,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:40,204 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:41:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-01-09 21:41:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113205323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885191799] [2025-01-09 21:41:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:40,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:40,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:40,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1267 out of 1473 [2025-01-09 21:41:40,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 321 transitions, 876 flow. Second operand has 4 states, 4 states have (on average 1278.25) internal successors, (5113), 4 states have internal predecessors, (5113), 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:41:40,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:40,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1267 of 1473 [2025-01-09 21:41:40,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:40,429 INFO L124 PetriNetUnfolderBase]: 0/821 cut-off events. [2025-01-09 21:41:40,429 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2025-01-09 21:41:40,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 821 events. 0/821 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 467 event pairs, 0 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 0. Up to 42 conditions per place. [2025-01-09 21:41:40,430 INFO L140 encePairwiseOnDemand]: 1469/1473 looper letters, 43 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2025-01-09 21:41:40,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 320 transitions, 966 flow [2025-01-09 21:41:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5115 transitions. [2025-01-09 21:41:40,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681262729124236 [2025-01-09 21:41:40,431 INFO L175 Difference]: Start difference. First operand has 426 places, 321 transitions, 876 flow. Second operand 4 states and 5115 transitions. [2025-01-09 21:41:40,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 320 transitions, 966 flow [2025-01-09 21:41:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 320 transitions, 965 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:40,434 INFO L231 Difference]: Finished difference. Result has 403 places, 320 transitions, 879 flow [2025-01-09 21:41:40,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1473, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=879, PETRI_PLACES=403, PETRI_TRANSITIONS=320} [2025-01-09 21:41:40,435 INFO L279 CegarLoopForPetriNet]: 432 programPoint places, -29 predicate places. [2025-01-09 21:41:40,435 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 320 transitions, 879 flow [2025-01-09 21:41:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1278.25) internal successors, (5113), 4 states have internal predecessors, (5113), 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:41:40,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:40,436 INFO L206 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-01-09 21:41:40,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:40,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 697688275, now seen corresponding path program 1 times [2025-01-09 21:41:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:40,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898612619] [2025-01-09 21:41:40,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:40,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 21:41:40,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 21:41:40,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:40,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:40,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:40,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 21:41:40,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 21:41:40,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:40,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:40,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:40,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (41 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 47 remaining) [2025-01-09 21:41:40,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 47 remaining) [2025-01-09 21:41:40,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 47 remaining) [2025-01-09 21:41:40,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 47 remaining) [2025-01-09 21:41:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-01-09 21:41:40,654 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:40,654 WARN L246 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:40,654 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2025-01-09 21:41:40,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1548 places, 1509 transitions, 6458 flow [2025-01-09 21:41:41,176 INFO L124 PetriNetUnfolderBase]: 166/2611 cut-off events. [2025-01-09 21:41:41,177 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2025-01-09 21:41:41,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 2611 events. 166/2611 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7545 event pairs, 0 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 3553. Up to 82 conditions per place. [2025-01-09 21:41:41,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 1548 places, 1509 transitions, 6458 flow [2025-01-09 21:41:41,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 441 places, 361 transitions, 2445 flow [2025-01-09 21:41:41,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:41,219 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:41,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-01-09 21:41:41,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:41,219 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:41,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:41,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:41,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:41,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:41,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1201899788, now seen corresponding path program 1 times [2025-01-09 21:41:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010026399] [2025-01-09 21:41:41,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:41,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:41,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:41,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:41,256 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:41:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010026399] [2025-01-09 21:41:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010026399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:41,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048303070] [2025-01-09 21:41:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:41,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:41,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:41,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:41,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1256 out of 1509 [2025-01-09 21:41:41,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 361 transitions, 2445 flow. Second operand has 3 states, 3 states have (on average 1257.3333333333333) internal successors, (3772), 3 states have internal predecessors, (3772), 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:41:41,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:41,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1256 of 1509 [2025-01-09 21:41:41,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:41,830 INFO L124 PetriNetUnfolderBase]: 83/2035 cut-off events. [2025-01-09 21:41:41,830 INFO L125 PetriNetUnfolderBase]: For 12301/12301 co-relation queries the response was YES. [2025-01-09 21:41:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 2035 events. 83/2035 cut-off events. For 12301/12301 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5395 event pairs, 41 based on Foata normal form. 1/1867 useless extension candidates. Maximal degree in co-relation 3171. Up to 293 conditions per place. [2025-01-09 21:41:41,857 INFO L140 encePairwiseOnDemand]: 1504/1509 looper letters, 50 selfloop transitions, 2 changer transitions 1/358 dead transitions. [2025-01-09 21:41:41,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 358 transitions, 2543 flow [2025-01-09 21:41:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3823 transitions. [2025-01-09 21:41:41,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444886238126795 [2025-01-09 21:41:41,858 INFO L175 Difference]: Start difference. First operand has 441 places, 361 transitions, 2445 flow. Second operand 3 states and 3823 transitions. [2025-01-09 21:41:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 358 transitions, 2543 flow [2025-01-09 21:41:41,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 358 transitions, 1060 flow, removed 741 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:41,874 INFO L231 Difference]: Finished difference. Result has 441 places, 357 transitions, 958 flow [2025-01-09 21:41:41,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1509, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=958, PETRI_PLACES=441, PETRI_TRANSITIONS=357} [2025-01-09 21:41:41,875 INFO L279 CegarLoopForPetriNet]: 441 programPoint places, 0 predicate places. [2025-01-09 21:41:41,875 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 357 transitions, 958 flow [2025-01-09 21:41:41,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1257.3333333333333) internal successors, (3772), 3 states have internal predecessors, (3772), 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:41:41,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:41,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:41,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-01-09 21:41:41,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:41,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1313547422, now seen corresponding path program 1 times [2025-01-09 21:41:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:41,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-01-09 21:41:41,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:41,910 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:41:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-01-09 21:41:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600220304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956783027] [2025-01-09 21:41:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:41,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:41,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1174 out of 1509 [2025-01-09 21:41:41,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 357 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 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:41:41,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:41,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1174 of 1509 [2025-01-09 21:41:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:42,325 INFO L124 PetriNetUnfolderBase]: 42/1826 cut-off events. [2025-01-09 21:41:42,325 INFO L125 PetriNetUnfolderBase]: For 899/899 co-relation queries the response was YES. [2025-01-09 21:41:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1826 events. 42/1826 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4034 event pairs, 0 based on Foata normal form. 41/1784 useless extension candidates. Maximal degree in co-relation 2222. Up to 210 conditions per place. [2025-01-09 21:41:42,346 INFO L140 encePairwiseOnDemand]: 1503/1509 looper letters, 48 selfloop transitions, 1 changer transitions 24/352 dead transitions. [2025-01-09 21:41:42,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 352 transitions, 1050 flow [2025-01-09 21:41:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3578 transitions. [2025-01-09 21:41:42,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7903688977247625 [2025-01-09 21:41:42,347 INFO L175 Difference]: Start difference. First operand has 441 places, 357 transitions, 958 flow. Second operand 3 states and 3578 transitions. [2025-01-09 21:41:42,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 352 transitions, 1050 flow [2025-01-09 21:41:42,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 352 transitions, 1046 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:42,350 INFO L231 Difference]: Finished difference. Result has 435 places, 328 transitions, 896 flow [2025-01-09 21:41:42,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1509, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=435, PETRI_TRANSITIONS=328} [2025-01-09 21:41:42,351 INFO L279 CegarLoopForPetriNet]: 441 programPoint places, -6 predicate places. [2025-01-09 21:41:42,351 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 328 transitions, 896 flow [2025-01-09 21:41:42,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1175.0) internal successors, (3525), 3 states have internal predecessors, (3525), 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:41:42,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:42,351 INFO L206 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2025-01-09 21:41:42,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:42,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash 384339040, now seen corresponding path program 1 times [2025-01-09 21:41:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42911191] [2025-01-09 21:41:42,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:42,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 21:41:42,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 21:41:42,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:42,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42911191] [2025-01-09 21:41:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42911191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266517842] [2025-01-09 21:41:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:42,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:42,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:42,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:42,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1298 out of 1509 [2025-01-09 21:41:42,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 328 transitions, 896 flow. Second operand has 4 states, 4 states have (on average 1309.5) internal successors, (5238), 4 states have internal predecessors, (5238), 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:41:42,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:42,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1298 of 1509 [2025-01-09 21:41:42,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:42,711 INFO L124 PetriNetUnfolderBase]: 0/841 cut-off events. [2025-01-09 21:41:42,711 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2025-01-09 21:41:42,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 841 events. 0/841 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 480 event pairs, 0 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 0. Up to 43 conditions per place. [2025-01-09 21:41:42,712 INFO L140 encePairwiseOnDemand]: 1505/1509 looper letters, 44 selfloop transitions, 3 changer transitions 0/327 dead transitions. [2025-01-09 21:41:42,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 327 transitions, 988 flow [2025-01-09 21:41:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5240 transitions. [2025-01-09 21:41:42,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681245858184228 [2025-01-09 21:41:42,714 INFO L175 Difference]: Start difference. First operand has 435 places, 328 transitions, 896 flow. Second operand 4 states and 5240 transitions. [2025-01-09 21:41:42,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 327 transitions, 988 flow [2025-01-09 21:41:42,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 327 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:42,716 INFO L231 Difference]: Finished difference. Result has 412 places, 327 transitions, 899 flow [2025-01-09 21:41:42,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1509, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=899, PETRI_PLACES=412, PETRI_TRANSITIONS=327} [2025-01-09 21:41:42,717 INFO L279 CegarLoopForPetriNet]: 441 programPoint places, -29 predicate places. [2025-01-09 21:41:42,717 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 327 transitions, 899 flow [2025-01-09 21:41:42,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1309.5) internal successors, (5238), 4 states have internal predecessors, (5238), 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:41:42,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:42,718 INFO L206 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-01-09 21:41:42,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:42,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1473640258, now seen corresponding path program 1 times [2025-01-09 21:41:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422375847] [2025-01-09 21:41:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:42,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 21:41:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 21:41:42,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:42,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:42,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 21:41:42,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 21:41:42,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:42,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:42,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:42,949 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-01-09 21:41:42,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-01-09 21:41:42,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-01-09 21:41:42,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-01-09 21:41:42,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-01-09 21:41:42,951 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:42,952 WARN L246 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:42,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2025-01-09 21:41:43,065 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1585 places, 1545 transitions, 6698 flow [2025-01-09 21:41:43,500 INFO L124 PetriNetUnfolderBase]: 170/2674 cut-off events. [2025-01-09 21:41:43,500 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2025-01-09 21:41:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 2674 events. 170/2674 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7758 event pairs, 0 based on Foata normal form. 0/2374 useless extension candidates. Maximal degree in co-relation 3660. Up to 84 conditions per place. [2025-01-09 21:41:43,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 1585 places, 1545 transitions, 6698 flow [2025-01-09 21:41:43,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 368 transitions, 2543 flow [2025-01-09 21:41:43,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:43,542 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:43,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-09 21:41:43,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:43,543 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:43,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:43,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:43,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:43,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -616077076, now seen corresponding path program 1 times [2025-01-09 21:41:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714289678] [2025-01-09 21:41:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:43,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:43,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:43,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:43,578 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:41:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714289678] [2025-01-09 21:41:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714289678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878081343] [2025-01-09 21:41:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:43,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:43,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:43,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:43,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1286 out of 1545 [2025-01-09 21:41:43,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 368 transitions, 2543 flow. Second operand has 3 states, 3 states have (on average 1287.3333333333333) internal successors, (3862), 3 states have internal predecessors, (3862), 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:41:43,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:43,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1286 of 1545 [2025-01-09 21:41:43,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:44,163 INFO L124 PetriNetUnfolderBase]: 85/2084 cut-off events. [2025-01-09 21:41:44,164 INFO L125 PetriNetUnfolderBase]: For 13203/13203 co-relation queries the response was YES. [2025-01-09 21:41:44,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 2084 events. 85/2084 cut-off events. For 13203/13203 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5502 event pairs, 42 based on Foata normal form. 1/1912 useless extension candidates. Maximal degree in co-relation 3271. Up to 300 conditions per place. [2025-01-09 21:41:44,187 INFO L140 encePairwiseOnDemand]: 1540/1545 looper letters, 51 selfloop transitions, 2 changer transitions 1/365 dead transitions. [2025-01-09 21:41:44,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 365 transitions, 2643 flow [2025-01-09 21:41:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3914 transitions. [2025-01-09 21:41:44,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-01-09 21:41:44,188 INFO L175 Difference]: Start difference. First operand has 450 places, 368 transitions, 2543 flow. Second operand 3 states and 3914 transitions. [2025-01-09 21:41:44,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 365 transitions, 2643 flow [2025-01-09 21:41:44,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 365 transitions, 1082 flow, removed 780 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:44,203 INFO L231 Difference]: Finished difference. Result has 450 places, 364 transitions, 978 flow [2025-01-09 21:41:44,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1545, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=978, PETRI_PLACES=450, PETRI_TRANSITIONS=364} [2025-01-09 21:41:44,203 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, 0 predicate places. [2025-01-09 21:41:44,203 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 364 transitions, 978 flow [2025-01-09 21:41:44,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1287.3333333333333) internal successors, (3862), 3 states have internal predecessors, (3862), 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:41:44,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:44,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:44,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-01-09 21:41:44,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:44,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1123166101, now seen corresponding path program 1 times [2025-01-09 21:41:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656408506] [2025-01-09 21:41:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:44,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:44,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:44,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:44,237 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:41:44,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:44,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656408506] [2025-01-09 21:41:44,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656408506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:44,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:44,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962502381] [2025-01-09 21:41:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:44,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:44,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:44,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:44,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1202 out of 1545 [2025-01-09 21:41:44,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 364 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 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:41:44,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:44,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1202 of 1545 [2025-01-09 21:41:44,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:44,658 INFO L124 PetriNetUnfolderBase]: 43/1870 cut-off events. [2025-01-09 21:41:44,659 INFO L125 PetriNetUnfolderBase]: For 942/942 co-relation queries the response was YES. [2025-01-09 21:41:44,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1870 events. 43/1870 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4092 event pairs, 0 based on Foata normal form. 42/1827 useless extension candidates. Maximal degree in co-relation 2276. Up to 215 conditions per place. [2025-01-09 21:41:44,681 INFO L140 encePairwiseOnDemand]: 1539/1545 looper letters, 49 selfloop transitions, 1 changer transitions 24/359 dead transitions. [2025-01-09 21:41:44,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 359 transitions, 1072 flow [2025-01-09 21:41:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3663 transitions. [2025-01-09 21:41:44,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7902912621359224 [2025-01-09 21:41:44,682 INFO L175 Difference]: Start difference. First operand has 450 places, 364 transitions, 978 flow. Second operand 3 states and 3663 transitions. [2025-01-09 21:41:44,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 359 transitions, 1072 flow [2025-01-09 21:41:44,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 359 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:44,685 INFO L231 Difference]: Finished difference. Result has 444 places, 335 transitions, 916 flow [2025-01-09 21:41:44,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1545, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=444, PETRI_TRANSITIONS=335} [2025-01-09 21:41:44,686 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -6 predicate places. [2025-01-09 21:41:44,686 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 335 transitions, 916 flow [2025-01-09 21:41:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 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:41:44,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:44,686 INFO L206 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2025-01-09 21:41:44,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1564102899, now seen corresponding path program 1 times [2025-01-09 21:41:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224019974] [2025-01-09 21:41:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:44,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-01-09 21:41:44,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-01-09 21:41:44,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:44,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224019974] [2025-01-09 21:41:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224019974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648700835] [2025-01-09 21:41:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:44,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:44,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1329 out of 1545 [2025-01-09 21:41:44,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 335 transitions, 916 flow. Second operand has 4 states, 4 states have (on average 1340.75) internal successors, (5363), 4 states have internal predecessors, (5363), 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:41:44,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:44,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1329 of 1545 [2025-01-09 21:41:44,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:45,036 INFO L124 PetriNetUnfolderBase]: 0/861 cut-off events. [2025-01-09 21:41:45,036 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2025-01-09 21:41:45,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 861 events. 0/861 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 492 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 0. Up to 44 conditions per place. [2025-01-09 21:41:45,037 INFO L140 encePairwiseOnDemand]: 1541/1545 looper letters, 45 selfloop transitions, 3 changer transitions 0/334 dead transitions. [2025-01-09 21:41:45,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 334 transitions, 1010 flow [2025-01-09 21:41:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5365 transitions. [2025-01-09 21:41:45,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681229773462783 [2025-01-09 21:41:45,039 INFO L175 Difference]: Start difference. First operand has 444 places, 335 transitions, 916 flow. Second operand 4 states and 5365 transitions. [2025-01-09 21:41:45,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 334 transitions, 1010 flow [2025-01-09 21:41:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 334 transitions, 1009 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:45,042 INFO L231 Difference]: Finished difference. Result has 421 places, 334 transitions, 919 flow [2025-01-09 21:41:45,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1545, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=919, PETRI_PLACES=421, PETRI_TRANSITIONS=334} [2025-01-09 21:41:45,042 INFO L279 CegarLoopForPetriNet]: 450 programPoint places, -29 predicate places. [2025-01-09 21:41:45,042 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 334 transitions, 919 flow [2025-01-09 21:41:45,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1340.75) internal successors, (5363), 4 states have internal predecessors, (5363), 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:41:45,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:45,043 INFO L206 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-01-09 21:41:45,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:45,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1306783916, now seen corresponding path program 1 times [2025-01-09 21:41:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019562240] [2025-01-09 21:41:45,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:45,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 21:41:45,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 21:41:45,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:45,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:45,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 21:41:45,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 21:41:45,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:45,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:45,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 49 remaining) [2025-01-09 21:41:45,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-01-09 21:41:45,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-01-09 21:41:45,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-01-09 21:41:45,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-01-09 21:41:45,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-01-09 21:41:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2025-01-09 21:41:45,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:45,286 WARN L246 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:45,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2025-01-09 21:41:45,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:45,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1622 places, 1581 transitions, 6942 flow [2025-01-09 21:41:45,857 INFO L124 PetriNetUnfolderBase]: 174/2737 cut-off events. [2025-01-09 21:41:45,857 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2025-01-09 21:41:45,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3853 conditions, 2737 events. 174/2737 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7855 event pairs, 0 based on Foata normal form. 0/2430 useless extension candidates. Maximal degree in co-relation 3768. Up to 86 conditions per place. [2025-01-09 21:41:45,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 1622 places, 1581 transitions, 6942 flow [2025-01-09 21:41:45,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 375 transitions, 2643 flow [2025-01-09 21:41:45,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:45,901 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:45,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:41:45,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:45,901 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:45,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:45,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:45,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:45,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1092995148, now seen corresponding path program 1 times [2025-01-09 21:41:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928511339] [2025-01-09 21:41:45,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:45,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:45,936 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:41:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928511339] [2025-01-09 21:41:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928511339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60335455] [2025-01-09 21:41:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:45,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:45,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:45,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:46,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1316 out of 1581 [2025-01-09 21:41:46,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 375 transitions, 2643 flow. Second operand has 3 states, 3 states have (on average 1317.3333333333333) internal successors, (3952), 3 states have internal predecessors, (3952), 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:41:46,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:46,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1316 of 1581 [2025-01-09 21:41:46,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:46,666 INFO L124 PetriNetUnfolderBase]: 87/2133 cut-off events. [2025-01-09 21:41:46,666 INFO L125 PetriNetUnfolderBase]: For 14148/14148 co-relation queries the response was YES. [2025-01-09 21:41:46,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2133 events. 87/2133 cut-off events. For 14148/14148 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5675 event pairs, 43 based on Foata normal form. 1/1957 useless extension candidates. Maximal degree in co-relation 3372. Up to 307 conditions per place. [2025-01-09 21:41:46,692 INFO L140 encePairwiseOnDemand]: 1576/1581 looper letters, 52 selfloop transitions, 2 changer transitions 1/372 dead transitions. [2025-01-09 21:41:46,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 372 transitions, 2745 flow [2025-01-09 21:41:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4005 transitions. [2025-01-09 21:41:46,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444022770398482 [2025-01-09 21:41:46,696 INFO L175 Difference]: Start difference. First operand has 459 places, 375 transitions, 2643 flow. Second operand 3 states and 4005 transitions. [2025-01-09 21:41:46,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 372 transitions, 2745 flow [2025-01-09 21:41:46,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 372 transitions, 1104 flow, removed 820 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:46,716 INFO L231 Difference]: Finished difference. Result has 459 places, 371 transitions, 998 flow [2025-01-09 21:41:46,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1581, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=459, PETRI_TRANSITIONS=371} [2025-01-09 21:41:46,716 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 0 predicate places. [2025-01-09 21:41:46,716 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 371 transitions, 998 flow [2025-01-09 21:41:46,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1317.3333333333333) internal successors, (3952), 3 states have internal predecessors, (3952), 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:41:46,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:46,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-01-09 21:41:46,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1306702232, now seen corresponding path program 1 times [2025-01-09 21:41:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277496209] [2025-01-09 21:41:46,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:46,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:46,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:46,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:46,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:46,775 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:41:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277496209] [2025-01-09 21:41:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277496209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121849649] [2025-01-09 21:41:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:46,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:46,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:46,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1230 out of 1581 [2025-01-09 21:41:46,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 371 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 1231.0) internal successors, (3693), 3 states have internal predecessors, (3693), 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:41:46,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:46,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1230 of 1581 [2025-01-09 21:41:46,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:47,371 INFO L124 PetriNetUnfolderBase]: 44/1914 cut-off events. [2025-01-09 21:41:47,371 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2025-01-09 21:41:47,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1914 events. 44/1914 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4192 event pairs, 0 based on Foata normal form. 43/1870 useless extension candidates. Maximal degree in co-relation 2330. Up to 220 conditions per place. [2025-01-09 21:41:47,397 INFO L140 encePairwiseOnDemand]: 1575/1581 looper letters, 50 selfloop transitions, 1 changer transitions 24/366 dead transitions. [2025-01-09 21:41:47,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 366 transitions, 1094 flow [2025-01-09 21:41:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3748 transitions. [2025-01-09 21:41:47,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7902171621336707 [2025-01-09 21:41:47,398 INFO L175 Difference]: Start difference. First operand has 459 places, 371 transitions, 998 flow. Second operand 3 states and 3748 transitions. [2025-01-09 21:41:47,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 366 transitions, 1094 flow [2025-01-09 21:41:47,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 366 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:47,402 INFO L231 Difference]: Finished difference. Result has 453 places, 342 transitions, 936 flow [2025-01-09 21:41:47,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1581, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=453, PETRI_TRANSITIONS=342} [2025-01-09 21:41:47,402 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -6 predicate places. [2025-01-09 21:41:47,402 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 342 transitions, 936 flow [2025-01-09 21:41:47,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1231.0) internal successors, (3693), 3 states have internal predecessors, (3693), 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:41:47,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:47,403 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-01-09 21:41:47,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1813486271, now seen corresponding path program 1 times [2025-01-09 21:41:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-01-09 21:41:47,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 21:41:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 21:41:47,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:47,513 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:41:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-01-09 21:41:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785588994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89405382] [2025-01-09 21:41:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:47,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:47,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1360 out of 1581 [2025-01-09 21:41:47,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 342 transitions, 936 flow. Second operand has 4 states, 4 states have (on average 1372.0) internal successors, (5488), 4 states have internal predecessors, (5488), 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:41:47,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:47,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1360 of 1581 [2025-01-09 21:41:47,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:47,761 INFO L124 PetriNetUnfolderBase]: 0/881 cut-off events. [2025-01-09 21:41:47,762 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2025-01-09 21:41:47,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 881 events. 0/881 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 504 event pairs, 0 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 0. Up to 45 conditions per place. [2025-01-09 21:41:47,762 INFO L140 encePairwiseOnDemand]: 1577/1581 looper letters, 46 selfloop transitions, 3 changer transitions 0/341 dead transitions. [2025-01-09 21:41:47,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 341 transitions, 1032 flow [2025-01-09 21:41:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5490 transitions. [2025-01-09 21:41:47,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681214421252372 [2025-01-09 21:41:47,764 INFO L175 Difference]: Start difference. First operand has 453 places, 342 transitions, 936 flow. Second operand 4 states and 5490 transitions. [2025-01-09 21:41:47,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 341 transitions, 1032 flow [2025-01-09 21:41:47,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 341 transitions, 1031 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:47,768 INFO L231 Difference]: Finished difference. Result has 430 places, 341 transitions, 939 flow [2025-01-09 21:41:47,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1581, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=939, PETRI_PLACES=430, PETRI_TRANSITIONS=341} [2025-01-09 21:41:47,768 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -29 predicate places. [2025-01-09 21:41:47,768 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 341 transitions, 939 flow [2025-01-09 21:41:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1372.0) internal successors, (5488), 4 states have internal predecessors, (5488), 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:41:47,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:47,769 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-01-09 21:41:47,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 488336533, now seen corresponding path program 1 times [2025-01-09 21:41:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:47,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330554046] [2025-01-09 21:41:47,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:47,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-09 21:41:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-09 21:41:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:47,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:47,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-09 21:41:47,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-09 21:41:47,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:47,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:48,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:48,029 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:48,029 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-01-09 21:41:48,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-01-09 21:41:48,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-01-09 21:41:48,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-01-09 21:41:48,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-01-09 21:41:48,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-01-09 21:41:48,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-01-09 21:41:48,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2025-01-09 21:41:48,032 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:48,032 WARN L246 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:48,032 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2025-01-09 21:41:48,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1659 places, 1617 transitions, 7190 flow [2025-01-09 21:41:48,631 INFO L124 PetriNetUnfolderBase]: 178/2800 cut-off events. [2025-01-09 21:41:48,631 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2025-01-09 21:41:48,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 2800 events. 178/2800 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8104 event pairs, 0 based on Foata normal form. 0/2486 useless extension candidates. Maximal degree in co-relation 3877. Up to 88 conditions per place. [2025-01-09 21:41:48,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 1659 places, 1617 transitions, 7190 flow [2025-01-09 21:41:48,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 468 places, 382 transitions, 2745 flow [2025-01-09 21:41:48,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:48,681 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:48,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:41:48,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:48,682 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:48,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:48,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:48,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:48,682 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:41:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2034149164, now seen corresponding path program 1 times [2025-01-09 21:41:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649151527] [2025-01-09 21:41:48,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:48,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:48,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:48,722 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:41:48,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649151527] [2025-01-09 21:41:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649151527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:48,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107792390] [2025-01-09 21:41:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:48,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:48,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:48,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:48,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1346 out of 1617 [2025-01-09 21:41:48,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 382 transitions, 2745 flow. Second operand has 3 states, 3 states have (on average 1347.3333333333333) internal successors, (4042), 3 states have internal predecessors, (4042), 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:41:48,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:48,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1346 of 1617 [2025-01-09 21:41:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:49,293 INFO L124 PetriNetUnfolderBase]: 89/2182 cut-off events. [2025-01-09 21:41:49,293 INFO L125 PetriNetUnfolderBase]: For 15137/15137 co-relation queries the response was YES. [2025-01-09 21:41:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 2182 events. 89/2182 cut-off events. For 15137/15137 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6027 event pairs, 44 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 3474. Up to 314 conditions per place. [2025-01-09 21:41:49,327 INFO L140 encePairwiseOnDemand]: 1612/1617 looper letters, 53 selfloop transitions, 2 changer transitions 1/379 dead transitions. [2025-01-09 21:41:49,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 379 transitions, 2849 flow [2025-01-09 21:41:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4096 transitions. [2025-01-09 21:41:49,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84436198721913 [2025-01-09 21:41:49,329 INFO L175 Difference]: Start difference. First operand has 468 places, 382 transitions, 2745 flow. Second operand 3 states and 4096 transitions. [2025-01-09 21:41:49,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 379 transitions, 2849 flow [2025-01-09 21:41:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 379 transitions, 1126 flow, removed 861 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:49,347 INFO L231 Difference]: Finished difference. Result has 468 places, 378 transitions, 1018 flow [2025-01-09 21:41:49,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1617, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=468, PETRI_TRANSITIONS=378} [2025-01-09 21:41:49,348 INFO L279 CegarLoopForPetriNet]: 468 programPoint places, 0 predicate places. [2025-01-09 21:41:49,348 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 378 transitions, 1018 flow [2025-01-09 21:41:49,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1347.3333333333333) internal successors, (4042), 3 states have internal predecessors, (4042), 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:41:49,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:49,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:49,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-01-09 21:41:49,348 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:41:49,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1681090281, now seen corresponding path program 1 times [2025-01-09 21:41:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242293481] [2025-01-09 21:41:49,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:49,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:49,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:49,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:49,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:49,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:41:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242293481] [2025-01-09 21:41:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242293481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:49,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633243406] [2025-01-09 21:41:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:49,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:49,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:49,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:49,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1258 out of 1617 [2025-01-09 21:41:49,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 378 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 1259.0) internal successors, (3777), 3 states have internal predecessors, (3777), 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:41:49,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:49,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1258 of 1617 [2025-01-09 21:41:49,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:49,959 INFO L124 PetriNetUnfolderBase]: 45/1958 cut-off events. [2025-01-09 21:41:49,959 INFO L125 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-01-09 21:41:49,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1958 events. 45/1958 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4465 event pairs, 0 based on Foata normal form. 44/1913 useless extension candidates. Maximal degree in co-relation 2384. Up to 225 conditions per place. [2025-01-09 21:41:49,985 INFO L140 encePairwiseOnDemand]: 1611/1617 looper letters, 51 selfloop transitions, 1 changer transitions 24/373 dead transitions. [2025-01-09 21:41:49,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 373 transitions, 1116 flow [2025-01-09 21:41:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3833 transitions. [2025-01-09 21:41:49,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.790146361574933 [2025-01-09 21:41:49,987 INFO L175 Difference]: Start difference. First operand has 468 places, 378 transitions, 1018 flow. Second operand 3 states and 3833 transitions. [2025-01-09 21:41:49,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 373 transitions, 1116 flow [2025-01-09 21:41:49,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 373 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:49,991 INFO L231 Difference]: Finished difference. Result has 462 places, 349 transitions, 956 flow [2025-01-09 21:41:49,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1617, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=462, PETRI_TRANSITIONS=349} [2025-01-09 21:41:49,991 INFO L279 CegarLoopForPetriNet]: 468 programPoint places, -6 predicate places. [2025-01-09 21:41:49,991 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 349 transitions, 956 flow [2025-01-09 21:41:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1259.0) internal successors, (3777), 3 states have internal predecessors, (3777), 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:41:49,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:49,992 INFO L206 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2025-01-09 21:41:49,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:49,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash 534139900, now seen corresponding path program 1 times [2025-01-09 21:41:49,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:49,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295773102] [2025-01-09 21:41:49,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:50,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-01-09 21:41:50,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-01-09 21:41:50,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:50,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:50,111 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:41:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295773102] [2025-01-09 21:41:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295773102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183904866] [2025-01-09 21:41:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:50,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:50,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:50,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1391 out of 1617 [2025-01-09 21:41:50,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 349 transitions, 956 flow. Second operand has 4 states, 4 states have (on average 1403.25) internal successors, (5613), 4 states have internal predecessors, (5613), 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:41:50,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:50,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1391 of 1617 [2025-01-09 21:41:50,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:50,393 INFO L124 PetriNetUnfolderBase]: 0/901 cut-off events. [2025-01-09 21:41:50,393 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-01-09 21:41:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 901 events. 0/901 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 515 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 0. Up to 46 conditions per place. [2025-01-09 21:41:50,394 INFO L140 encePairwiseOnDemand]: 1613/1617 looper letters, 47 selfloop transitions, 3 changer transitions 0/348 dead transitions. [2025-01-09 21:41:50,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 348 transitions, 1054 flow [2025-01-09 21:41:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5615 transitions. [2025-01-09 21:41:50,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681199752628324 [2025-01-09 21:41:50,396 INFO L175 Difference]: Start difference. First operand has 462 places, 349 transitions, 956 flow. Second operand 4 states and 5615 transitions. [2025-01-09 21:41:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 348 transitions, 1054 flow [2025-01-09 21:41:50,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 348 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:50,400 INFO L231 Difference]: Finished difference. Result has 439 places, 348 transitions, 959 flow [2025-01-09 21:41:50,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1617, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=959, PETRI_PLACES=439, PETRI_TRANSITIONS=348} [2025-01-09 21:41:50,400 INFO L279 CegarLoopForPetriNet]: 468 programPoint places, -29 predicate places. [2025-01-09 21:41:50,400 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 348 transitions, 959 flow [2025-01-09 21:41:50,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1403.25) internal successors, (5613), 4 states have internal predecessors, (5613), 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:41:50,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:50,401 INFO L206 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-01-09 21:41:50,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:50,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2021382015, now seen corresponding path program 1 times [2025-01-09 21:41:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:50,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476235836] [2025-01-09 21:41:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:50,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 21:41:50,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 21:41:50,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:50,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:50,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:50,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 21:41:50,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 21:41:50,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:50,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:50,682 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:50,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-01-09 21:41:50,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-01-09 21:41:50,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-01-09 21:41:50,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-01-09 21:41:50,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-01-09 21:41:50,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-01-09 21:41:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-01-09 21:41:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-01-09 21:41:50,684 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:50,684 WARN L246 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:50,684 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2025-01-09 21:41:50,809 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1696 places, 1653 transitions, 7442 flow [2025-01-09 21:41:51,323 INFO L124 PetriNetUnfolderBase]: 182/2863 cut-off events. [2025-01-09 21:41:51,323 INFO L125 PetriNetUnfolderBase]: For 15136/15136 co-relation queries the response was YES. [2025-01-09 21:41:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 2863 events. 182/2863 cut-off events. For 15136/15136 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8242 event pairs, 0 based on Foata normal form. 0/2542 useless extension candidates. Maximal degree in co-relation 3987. Up to 90 conditions per place. [2025-01-09 21:41:51,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 1696 places, 1653 transitions, 7442 flow [2025-01-09 21:41:51,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 477 places, 389 transitions, 2849 flow [2025-01-09 21:41:51,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:51,376 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:51,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-09 21:41:51,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:51,377 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:51,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:51,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:51,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:51,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2087582324, now seen corresponding path program 1 times [2025-01-09 21:41:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740047952] [2025-01-09 21:41:51,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:51,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:51,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:51,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:51,420 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:41:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740047952] [2025-01-09 21:41:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740047952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981711821] [2025-01-09 21:41:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:51,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1376 out of 1653 [2025-01-09 21:41:51,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 389 transitions, 2849 flow. Second operand has 3 states, 3 states have (on average 1377.3333333333333) internal successors, (4132), 3 states have internal predecessors, (4132), 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:41:51,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:51,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1376 of 1653 [2025-01-09 21:41:51,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:52,007 INFO L124 PetriNetUnfolderBase]: 91/2231 cut-off events. [2025-01-09 21:41:52,007 INFO L125 PetriNetUnfolderBase]: For 16171/16171 co-relation queries the response was YES. [2025-01-09 21:41:52,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 2231 events. 91/2231 cut-off events. For 16171/16171 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6133 event pairs, 45 based on Foata normal form. 1/2047 useless extension candidates. Maximal degree in co-relation 3577. Up to 321 conditions per place. [2025-01-09 21:41:52,044 INFO L140 encePairwiseOnDemand]: 1648/1653 looper letters, 54 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-01-09 21:41:52,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 386 transitions, 2955 flow [2025-01-09 21:41:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4187 transitions. [2025-01-09 21:41:52,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8443234523089332 [2025-01-09 21:41:52,046 INFO L175 Difference]: Start difference. First operand has 477 places, 389 transitions, 2849 flow. Second operand 3 states and 4187 transitions. [2025-01-09 21:41:52,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 386 transitions, 2955 flow [2025-01-09 21:41:52,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 386 transitions, 1148 flow, removed 903 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:52,065 INFO L231 Difference]: Finished difference. Result has 477 places, 385 transitions, 1038 flow [2025-01-09 21:41:52,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1653, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=477, PETRI_TRANSITIONS=385} [2025-01-09 21:41:52,065 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 0 predicate places. [2025-01-09 21:41:52,065 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 385 transitions, 1038 flow [2025-01-09 21:41:52,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1377.3333333333333) internal successors, (4132), 3 states have internal predecessors, (4132), 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:41:52,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:52,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:52,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-01-09 21:41:52,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1954, now seen corresponding path program 1 times [2025-01-09 21:41:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006682921] [2025-01-09 21:41:52,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:52,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:52,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:52,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:52,107 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:41:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006682921] [2025-01-09 21:41:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006682921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237243064] [2025-01-09 21:41:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:52,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:52,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:52,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1286 out of 1653 [2025-01-09 21:41:52,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 385 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 1287.0) internal successors, (3861), 3 states have internal predecessors, (3861), 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:41:52,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:52,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1286 of 1653 [2025-01-09 21:41:52,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:52,705 INFO L124 PetriNetUnfolderBase]: 46/2002 cut-off events. [2025-01-09 21:41:52,706 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2025-01-09 21:41:52,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2002 events. 46/2002 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4524 event pairs, 0 based on Foata normal form. 45/1956 useless extension candidates. Maximal degree in co-relation 2438. Up to 230 conditions per place. [2025-01-09 21:41:52,729 INFO L140 encePairwiseOnDemand]: 1647/1653 looper letters, 52 selfloop transitions, 1 changer transitions 24/380 dead transitions. [2025-01-09 21:41:52,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 380 transitions, 1138 flow [2025-01-09 21:41:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3918 transitions. [2025-01-09 21:41:52,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900786448880823 [2025-01-09 21:41:52,731 INFO L175 Difference]: Start difference. First operand has 477 places, 385 transitions, 1038 flow. Second operand 3 states and 3918 transitions. [2025-01-09 21:41:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 380 transitions, 1138 flow [2025-01-09 21:41:52,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 380 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:52,735 INFO L231 Difference]: Finished difference. Result has 471 places, 356 transitions, 976 flow [2025-01-09 21:41:52,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1653, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=471, PETRI_TRANSITIONS=356} [2025-01-09 21:41:52,735 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -6 predicate places. [2025-01-09 21:41:52,735 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 356 transitions, 976 flow [2025-01-09 21:41:52,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1287.0) internal successors, (3861), 3 states have internal predecessors, (3861), 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:41:52,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:52,736 INFO L206 CegarLoopForPetriNet]: trace histogram [45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2025-01-09 21:41:52,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1848389694, now seen corresponding path program 1 times [2025-01-09 21:41:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667153983] [2025-01-09 21:41:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:52,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-01-09 21:41:52,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-01-09 21:41:52,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:52,854 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:41:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:52,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667153983] [2025-01-09 21:41:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667153983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677862190] [2025-01-09 21:41:52,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:52,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:52,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:52,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:52,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1422 out of 1653 [2025-01-09 21:41:52,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 356 transitions, 976 flow. Second operand has 4 states, 4 states have (on average 1434.5) internal successors, (5738), 4 states have internal predecessors, (5738), 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:41:52,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:52,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1422 of 1653 [2025-01-09 21:41:52,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:53,109 INFO L124 PetriNetUnfolderBase]: 0/921 cut-off events. [2025-01-09 21:41:53,109 INFO L125 PetriNetUnfolderBase]: For 1076/1076 co-relation queries the response was YES. [2025-01-09 21:41:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 921 events. 0/921 cut-off events. For 1076/1076 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 528 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 0. Up to 47 conditions per place. [2025-01-09 21:41:53,110 INFO L140 encePairwiseOnDemand]: 1649/1653 looper letters, 48 selfloop transitions, 3 changer transitions 0/355 dead transitions. [2025-01-09 21:41:53,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 355 transitions, 1076 flow [2025-01-09 21:41:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5740 transitions. [2025-01-09 21:41:53,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868118572292801 [2025-01-09 21:41:53,112 INFO L175 Difference]: Start difference. First operand has 471 places, 356 transitions, 976 flow. Second operand 4 states and 5740 transitions. [2025-01-09 21:41:53,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 355 transitions, 1076 flow [2025-01-09 21:41:53,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 355 transitions, 1075 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:53,116 INFO L231 Difference]: Finished difference. Result has 448 places, 355 transitions, 979 flow [2025-01-09 21:41:53,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1653, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=979, PETRI_PLACES=448, PETRI_TRANSITIONS=355} [2025-01-09 21:41:53,116 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -29 predicate places. [2025-01-09 21:41:53,116 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 355 transitions, 979 flow [2025-01-09 21:41:53,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1434.5) internal successors, (5738), 4 states have internal predecessors, (5738), 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:41:53,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:53,117 INFO L206 CegarLoopForPetriNet]: trace histogram [45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-01-09 21:41:53,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 871291672, now seen corresponding path program 1 times [2025-01-09 21:41:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073888518] [2025-01-09 21:41:53,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-01-09 21:41:53,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-01-09 21:41:53,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:53,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:53,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:53,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-01-09 21:41:53,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-01-09 21:41:53,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:53,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:53,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:53,407 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-01-09 21:41:53,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-01-09 21:41:53,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-01-09 21:41:53,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-01-09 21:41:53,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2025-01-09 21:41:53,410 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:53,410 WARN L246 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:53,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2025-01-09 21:41:53,532 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:53,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1733 places, 1689 transitions, 7698 flow [2025-01-09 21:41:54,062 INFO L124 PetriNetUnfolderBase]: 186/2926 cut-off events. [2025-01-09 21:41:54,062 INFO L125 PetriNetUnfolderBase]: For 16170/16170 co-relation queries the response was YES. [2025-01-09 21:41:54,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 2926 events. 186/2926 cut-off events. For 16170/16170 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8453 event pairs, 0 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 4098. Up to 92 conditions per place. [2025-01-09 21:41:54,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 1733 places, 1689 transitions, 7698 flow [2025-01-09 21:41:54,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 486 places, 396 transitions, 2955 flow [2025-01-09 21:41:54,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:54,116 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:54,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-09 21:41:54,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:54,117 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:54,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:54,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:54,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:54,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:41:54,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1612702572, now seen corresponding path program 1 times [2025-01-09 21:41:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443111147] [2025-01-09 21:41:54,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:54,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:54,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:54,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:54,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:54,159 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:41:54,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:54,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443111147] [2025-01-09 21:41:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443111147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:54,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662774354] [2025-01-09 21:41:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:54,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:54,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:54,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:54,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1406 out of 1689 [2025-01-09 21:41:54,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 396 transitions, 2955 flow. Second operand has 3 states, 3 states have (on average 1407.3333333333333) internal successors, (4222), 3 states have internal predecessors, (4222), 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:41:54,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:54,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1406 of 1689 [2025-01-09 21:41:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:54,754 INFO L124 PetriNetUnfolderBase]: 93/2280 cut-off events. [2025-01-09 21:41:54,754 INFO L125 PetriNetUnfolderBase]: For 17251/17251 co-relation queries the response was YES. [2025-01-09 21:41:54,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 2280 events. 93/2280 cut-off events. For 17251/17251 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6062 event pairs, 46 based on Foata normal form. 1/2092 useless extension candidates. Maximal degree in co-relation 3681. Up to 328 conditions per place. [2025-01-09 21:41:54,792 INFO L140 encePairwiseOnDemand]: 1684/1689 looper letters, 55 selfloop transitions, 2 changer transitions 1/393 dead transitions. [2025-01-09 21:41:54,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 393 transitions, 3063 flow [2025-01-09 21:41:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4278 transitions. [2025-01-09 21:41:54,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442865600947306 [2025-01-09 21:41:54,794 INFO L175 Difference]: Start difference. First operand has 486 places, 396 transitions, 2955 flow. Second operand 3 states and 4278 transitions. [2025-01-09 21:41:54,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 393 transitions, 3063 flow [2025-01-09 21:41:54,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 393 transitions, 1170 flow, removed 946 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:54,817 INFO L231 Difference]: Finished difference. Result has 486 places, 392 transitions, 1058 flow [2025-01-09 21:41:54,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1689, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=486, PETRI_TRANSITIONS=392} [2025-01-09 21:41:54,818 INFO L279 CegarLoopForPetriNet]: 486 programPoint places, 0 predicate places. [2025-01-09 21:41:54,818 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 392 transitions, 1058 flow [2025-01-09 21:41:54,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1407.3333333333333) internal successors, (4222), 3 states have internal predecessors, (4222), 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:41:54,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:54,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:54,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-01-09 21:41:54,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:41:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 558392823, now seen corresponding path program 1 times [2025-01-09 21:41:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892411561] [2025-01-09 21:41:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:54,862 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:41:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892411561] [2025-01-09 21:41:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892411561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885136110] [2025-01-09 21:41:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:54,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:54,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:54,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:54,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1314 out of 1689 [2025-01-09 21:41:54,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 392 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 1315.0) internal successors, (3945), 3 states have internal predecessors, (3945), 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:41:54,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:54,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1314 of 1689 [2025-01-09 21:41:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:55,460 INFO L124 PetriNetUnfolderBase]: 47/2046 cut-off events. [2025-01-09 21:41:55,460 INFO L125 PetriNetUnfolderBase]: For 1124/1124 co-relation queries the response was YES. [2025-01-09 21:41:55,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 2046 events. 47/2046 cut-off events. For 1124/1124 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4488 event pairs, 0 based on Foata normal form. 46/1999 useless extension candidates. Maximal degree in co-relation 2492. Up to 235 conditions per place. [2025-01-09 21:41:55,482 INFO L140 encePairwiseOnDemand]: 1683/1689 looper letters, 53 selfloop transitions, 1 changer transitions 24/387 dead transitions. [2025-01-09 21:41:55,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 387 transitions, 1160 flow [2025-01-09 21:41:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4003 transitions. [2025-01-09 21:41:55,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900138148806 [2025-01-09 21:41:55,484 INFO L175 Difference]: Start difference. First operand has 486 places, 392 transitions, 1058 flow. Second operand 3 states and 4003 transitions. [2025-01-09 21:41:55,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 387 transitions, 1160 flow [2025-01-09 21:41:55,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 387 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:55,487 INFO L231 Difference]: Finished difference. Result has 480 places, 363 transitions, 996 flow [2025-01-09 21:41:55,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1689, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=996, PETRI_PLACES=480, PETRI_TRANSITIONS=363} [2025-01-09 21:41:55,488 INFO L279 CegarLoopForPetriNet]: 486 programPoint places, -6 predicate places. [2025-01-09 21:41:55,488 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 363 transitions, 996 flow [2025-01-09 21:41:55,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1315.0) internal successors, (3945), 3 states have internal predecessors, (3945), 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:41:55,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:55,488 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:55,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-01-09 21:41:55,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:41:55,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -208814329, now seen corresponding path program 1 times [2025-01-09 21:41:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:55,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399289065] [2025-01-09 21:41:55,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-01-09 21:41:55,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-01-09 21:41:55,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:55,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:55,606 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:41:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399289065] [2025-01-09 21:41:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399289065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:55,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:55,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719315309] [2025-01-09 21:41:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:55,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1453 out of 1689 [2025-01-09 21:41:55,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 363 transitions, 996 flow. Second operand has 4 states, 4 states have (on average 1465.75) internal successors, (5863), 4 states have internal predecessors, (5863), 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:41:55,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:55,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1453 of 1689 [2025-01-09 21:41:55,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:55,868 INFO L124 PetriNetUnfolderBase]: 0/941 cut-off events. [2025-01-09 21:41:55,868 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2025-01-09 21:41:55,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 941 events. 0/941 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 540 event pairs, 0 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 0. Up to 48 conditions per place. [2025-01-09 21:41:55,869 INFO L140 encePairwiseOnDemand]: 1685/1689 looper letters, 49 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2025-01-09 21:41:55,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 362 transitions, 1098 flow [2025-01-09 21:41:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5865 transitions. [2025-01-09 21:41:55,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681172291296625 [2025-01-09 21:41:55,871 INFO L175 Difference]: Start difference. First operand has 480 places, 363 transitions, 996 flow. Second operand 4 states and 5865 transitions. [2025-01-09 21:41:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 362 transitions, 1098 flow [2025-01-09 21:41:55,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 362 transitions, 1097 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:55,875 INFO L231 Difference]: Finished difference. Result has 457 places, 362 transitions, 999 flow [2025-01-09 21:41:55,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1689, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=999, PETRI_PLACES=457, PETRI_TRANSITIONS=362} [2025-01-09 21:41:55,875 INFO L279 CegarLoopForPetriNet]: 486 programPoint places, -29 predicate places. [2025-01-09 21:41:55,875 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 362 transitions, 999 flow [2025-01-09 21:41:55,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1465.75) internal successors, (5863), 4 states have internal predecessors, (5863), 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:41:55,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:55,876 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:55,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-01-09 21:41:55,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:41:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -977228710, now seen corresponding path program 1 times [2025-01-09 21:41:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715543077] [2025-01-09 21:41:55,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:55,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:41:55,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:41:55,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:55,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:55,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:55,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:41:55,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:41:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:56,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:56,181 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-01-09 21:41:56,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-01-09 21:41:56,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-01-09 21:41:56,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-01-09 21:41:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2025-01-09 21:41:56,184 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:56,184 WARN L246 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:56,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2025-01-09 21:41:56,314 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:56,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1770 places, 1725 transitions, 7958 flow [2025-01-09 21:41:56,861 INFO L124 PetriNetUnfolderBase]: 190/2989 cut-off events. [2025-01-09 21:41:56,862 INFO L125 PetriNetUnfolderBase]: For 17250/17250 co-relation queries the response was YES. [2025-01-09 21:41:56,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4303 conditions, 2989 events. 190/2989 cut-off events. For 17250/17250 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8745 event pairs, 0 based on Foata normal form. 0/2654 useless extension candidates. Maximal degree in co-relation 4210. Up to 94 conditions per place. [2025-01-09 21:41:56,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 1770 places, 1725 transitions, 7958 flow [2025-01-09 21:41:56,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 495 places, 403 transitions, 3063 flow [2025-01-09 21:41:56,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:56,916 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:56,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-01-09 21:41:56,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:56,916 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:41:56,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:56,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:56,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:56,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:41:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 250101964, now seen corresponding path program 1 times [2025-01-09 21:41:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657468893] [2025-01-09 21:41:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:41:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:41:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:56,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:56,958 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:41:56,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:56,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657468893] [2025-01-09 21:41:56,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657468893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:56,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140067103] [2025-01-09 21:41:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:56,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:56,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:56,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:57,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1436 out of 1725 [2025-01-09 21:41:57,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 403 transitions, 3063 flow. Second operand has 3 states, 3 states have (on average 1437.3333333333333) internal successors, (4312), 3 states have internal predecessors, (4312), 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:41:57,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:57,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1436 of 1725 [2025-01-09 21:41:57,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:57,588 INFO L124 PetriNetUnfolderBase]: 95/2329 cut-off events. [2025-01-09 21:41:57,588 INFO L125 PetriNetUnfolderBase]: For 18378/18378 co-relation queries the response was YES. [2025-01-09 21:41:57,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 2329 events. 95/2329 cut-off events. For 18378/18378 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6401 event pairs, 47 based on Foata normal form. 1/2137 useless extension candidates. Maximal degree in co-relation 3786. Up to 335 conditions per place. [2025-01-09 21:41:57,628 INFO L140 encePairwiseOnDemand]: 1720/1725 looper letters, 56 selfloop transitions, 2 changer transitions 1/400 dead transitions. [2025-01-09 21:41:57,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 400 transitions, 3173 flow [2025-01-09 21:41:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4369 transitions. [2025-01-09 21:41:57,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442512077294686 [2025-01-09 21:41:57,629 INFO L175 Difference]: Start difference. First operand has 495 places, 403 transitions, 3063 flow. Second operand 3 states and 4369 transitions. [2025-01-09 21:41:57,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 400 transitions, 3173 flow [2025-01-09 21:41:57,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 400 transitions, 1192 flow, removed 990 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:57,653 INFO L231 Difference]: Finished difference. Result has 495 places, 399 transitions, 1078 flow [2025-01-09 21:41:57,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1725, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=495, PETRI_TRANSITIONS=399} [2025-01-09 21:41:57,654 INFO L279 CegarLoopForPetriNet]: 495 programPoint places, 0 predicate places. [2025-01-09 21:41:57,654 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 399 transitions, 1078 flow [2025-01-09 21:41:57,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1437.3333333333333) internal successors, (4312), 3 states have internal predecessors, (4312), 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:41:57,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:57,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:57,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-01-09 21:41:57,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:41:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -938692684, now seen corresponding path program 1 times [2025-01-09 21:41:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737626419] [2025-01-09 21:41:57,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:57,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:41:57,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:41:57,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:57,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:57,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:57,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737626419] [2025-01-09 21:41:57,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737626419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:57,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:57,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367611890] [2025-01-09 21:41:57,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:57,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:57,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:57,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:57,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1342 out of 1725 [2025-01-09 21:41:57,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 399 transitions, 1078 flow. Second operand has 3 states, 3 states have (on average 1343.0) internal successors, (4029), 3 states have internal predecessors, (4029), 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:41:57,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:57,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1342 of 1725 [2025-01-09 21:41:57,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:58,325 INFO L124 PetriNetUnfolderBase]: 48/2090 cut-off events. [2025-01-09 21:41:58,325 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-01-09 21:41:58,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 2090 events. 48/2090 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4728 event pairs, 0 based on Foata normal form. 47/2042 useless extension candidates. Maximal degree in co-relation 2546. Up to 240 conditions per place. [2025-01-09 21:41:58,352 INFO L140 encePairwiseOnDemand]: 1719/1725 looper letters, 54 selfloop transitions, 1 changer transitions 24/394 dead transitions. [2025-01-09 21:41:58,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 394 transitions, 1182 flow [2025-01-09 21:41:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4088 transitions. [2025-01-09 21:41:58,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.789951690821256 [2025-01-09 21:41:58,354 INFO L175 Difference]: Start difference. First operand has 495 places, 399 transitions, 1078 flow. Second operand 3 states and 4088 transitions. [2025-01-09 21:41:58,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 394 transitions, 1182 flow [2025-01-09 21:41:58,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 394 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:58,358 INFO L231 Difference]: Finished difference. Result has 489 places, 370 transitions, 1016 flow [2025-01-09 21:41:58,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1725, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=489, PETRI_TRANSITIONS=370} [2025-01-09 21:41:58,358 INFO L279 CegarLoopForPetriNet]: 495 programPoint places, -6 predicate places. [2025-01-09 21:41:58,358 INFO L471 AbstractCegarLoop]: Abstraction has has 489 places, 370 transitions, 1016 flow [2025-01-09 21:41:58,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1343.0) internal successors, (4029), 3 states have internal predecessors, (4029), 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:41:58,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:58,359 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:58,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2025-01-09 21:41:58,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:41:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 295032151, now seen corresponding path program 1 times [2025-01-09 21:41:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224300270] [2025-01-09 21:41:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-01-09 21:41:58,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-09 21:41:58,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:58,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:58,480 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:41:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224300270] [2025-01-09 21:41:58,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224300270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:41:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975836146] [2025-01-09 21:41:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:58,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:41:58,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:58,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:41:58,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:41:58,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1484 out of 1725 [2025-01-09 21:41:58,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 370 transitions, 1016 flow. Second operand has 4 states, 4 states have (on average 1497.0) internal successors, (5988), 4 states have internal predecessors, (5988), 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:41:58,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:58,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1484 of 1725 [2025-01-09 21:41:58,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:58,743 INFO L124 PetriNetUnfolderBase]: 0/961 cut-off events. [2025-01-09 21:41:58,743 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2025-01-09 21:41:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 961 events. 0/961 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 552 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 0. Up to 49 conditions per place. [2025-01-09 21:41:58,744 INFO L140 encePairwiseOnDemand]: 1721/1725 looper letters, 50 selfloop transitions, 3 changer transitions 0/369 dead transitions. [2025-01-09 21:41:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 369 transitions, 1120 flow [2025-01-09 21:41:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:41:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:41:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5990 transitions. [2025-01-09 21:41:58,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681159420289855 [2025-01-09 21:41:58,746 INFO L175 Difference]: Start difference. First operand has 489 places, 370 transitions, 1016 flow. Second operand 4 states and 5990 transitions. [2025-01-09 21:41:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 369 transitions, 1120 flow [2025-01-09 21:41:58,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 369 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:58,749 INFO L231 Difference]: Finished difference. Result has 466 places, 369 transitions, 1019 flow [2025-01-09 21:41:58,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1725, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=466, PETRI_TRANSITIONS=369} [2025-01-09 21:41:58,750 INFO L279 CegarLoopForPetriNet]: 495 programPoint places, -29 predicate places. [2025-01-09 21:41:58,750 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 369 transitions, 1019 flow [2025-01-09 21:41:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1497.0) internal successors, (5988), 4 states have internal predecessors, (5988), 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:41:58,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:58,751 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:58,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-01-09 21:41:58,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:41:58,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash -558148537, now seen corresponding path program 1 times [2025-01-09 21:41:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056213043] [2025-01-09 21:41:58,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:58,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 21:41:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 21:41:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:58,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:58,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 21:41:59,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 21:41:59,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:59,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:59,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:59,287 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:59,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 54 remaining) [2025-01-09 21:41:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-01-09 21:41:59,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-01-09 21:41:59,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-01-09 21:41:59,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-01-09 21:41:59,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-01-09 21:41:59,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:59,291 WARN L246 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:59,291 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2025-01-09 21:41:59,503 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:59,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1807 places, 1761 transitions, 8222 flow [2025-01-09 21:42:00,166 INFO L124 PetriNetUnfolderBase]: 194/3052 cut-off events. [2025-01-09 21:42:00,166 INFO L125 PetriNetUnfolderBase]: For 18377/18377 co-relation queries the response was YES. [2025-01-09 21:42:00,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4418 conditions, 3052 events. 194/3052 cut-off events. For 18377/18377 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8983 event pairs, 0 based on Foata normal form. 0/2710 useless extension candidates. Maximal degree in co-relation 4323. Up to 96 conditions per place. [2025-01-09 21:42:00,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 1807 places, 1761 transitions, 8222 flow [2025-01-09 21:42:00,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 504 places, 410 transitions, 3173 flow [2025-01-09 21:42:00,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:00,225 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:00,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-09 21:42:00,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:00,229 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:00,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:00,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:00,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:00,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1880416852, now seen corresponding path program 1 times [2025-01-09 21:42:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185652639] [2025-01-09 21:42:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:00,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:00,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:00,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:00,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:00,303 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:42:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185652639] [2025-01-09 21:42:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185652639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:00,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:00,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996776305] [2025-01-09 21:42:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:00,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:00,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1466 out of 1761 [2025-01-09 21:42:00,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 410 transitions, 3173 flow. Second operand has 3 states, 3 states have (on average 1467.3333333333333) internal successors, (4402), 3 states have internal predecessors, (4402), 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:42:00,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:00,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1466 of 1761 [2025-01-09 21:42:00,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:00,951 INFO L124 PetriNetUnfolderBase]: 97/2378 cut-off events. [2025-01-09 21:42:00,951 INFO L125 PetriNetUnfolderBase]: For 19553/19553 co-relation queries the response was YES. [2025-01-09 21:42:00,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 2378 events. 97/2378 cut-off events. For 19553/19553 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6569 event pairs, 48 based on Foata normal form. 1/2182 useless extension candidates. Maximal degree in co-relation 3892. Up to 342 conditions per place. [2025-01-09 21:42:00,991 INFO L140 encePairwiseOnDemand]: 1756/1761 looper letters, 57 selfloop transitions, 2 changer transitions 1/407 dead transitions. [2025-01-09 21:42:00,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 407 transitions, 3285 flow [2025-01-09 21:42:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4460 transitions. [2025-01-09 21:42:00,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442173007760742 [2025-01-09 21:42:00,993 INFO L175 Difference]: Start difference. First operand has 504 places, 410 transitions, 3173 flow. Second operand 3 states and 4460 transitions. [2025-01-09 21:42:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 407 transitions, 3285 flow [2025-01-09 21:42:01,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 407 transitions, 1214 flow, removed 1035 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:01,103 INFO L231 Difference]: Finished difference. Result has 504 places, 406 transitions, 1098 flow [2025-01-09 21:42:01,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1761, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=504, PETRI_TRANSITIONS=406} [2025-01-09 21:42:01,103 INFO L279 CegarLoopForPetriNet]: 504 programPoint places, 0 predicate places. [2025-01-09 21:42:01,103 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 406 transitions, 1098 flow [2025-01-09 21:42:01,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1467.3333333333333) internal successors, (4402), 3 states have internal predecessors, (4402), 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:42:01,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:01,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-01-09 21:42:01,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -196291179, now seen corresponding path program 1 times [2025-01-09 21:42:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149171264] [2025-01-09 21:42:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:01,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:01,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:01,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:01,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:01,147 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:42:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149171264] [2025-01-09 21:42:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149171264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31953261] [2025-01-09 21:42:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:01,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:01,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:01,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1370 out of 1761 [2025-01-09 21:42:01,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 406 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 1371.0) internal successors, (4113), 3 states have internal predecessors, (4113), 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:42:01,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:01,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1370 of 1761 [2025-01-09 21:42:01,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:01,797 INFO L124 PetriNetUnfolderBase]: 49/2134 cut-off events. [2025-01-09 21:42:01,798 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-01-09 21:42:01,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 2134 events. 49/2134 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4829 event pairs, 0 based on Foata normal form. 48/2085 useless extension candidates. Maximal degree in co-relation 2600. Up to 245 conditions per place. [2025-01-09 21:42:01,812 INFO L140 encePairwiseOnDemand]: 1755/1761 looper letters, 55 selfloop transitions, 1 changer transitions 24/401 dead transitions. [2025-01-09 21:42:01,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 401 transitions, 1204 flow [2025-01-09 21:42:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4173 transitions. [2025-01-09 21:42:01,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7898921067575241 [2025-01-09 21:42:01,814 INFO L175 Difference]: Start difference. First operand has 504 places, 406 transitions, 1098 flow. Second operand 3 states and 4173 transitions. [2025-01-09 21:42:01,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 401 transitions, 1204 flow [2025-01-09 21:42:01,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 401 transitions, 1200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:01,818 INFO L231 Difference]: Finished difference. Result has 498 places, 377 transitions, 1036 flow [2025-01-09 21:42:01,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1761, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=498, PETRI_TRANSITIONS=377} [2025-01-09 21:42:01,819 INFO L279 CegarLoopForPetriNet]: 504 programPoint places, -6 predicate places. [2025-01-09 21:42:01,819 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 377 transitions, 1036 flow [2025-01-09 21:42:01,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1371.0) internal successors, (4113), 3 states have internal predecessors, (4113), 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:42:01,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:01,819 INFO L206 CegarLoopForPetriNet]: trace histogram [48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:01,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2025-01-09 21:42:01,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -70887378, now seen corresponding path program 1 times [2025-01-09 21:42:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332169571] [2025-01-09 21:42:01,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-01-09 21:42:01,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-01-09 21:42:01,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:01,971 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:42:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:01,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332169571] [2025-01-09 21:42:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332169571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154943725] [2025-01-09 21:42:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:01,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:01,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:01,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:02,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1515 out of 1761 [2025-01-09 21:42:02,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 377 transitions, 1036 flow. Second operand has 4 states, 4 states have (on average 1528.25) internal successors, (6113), 4 states have internal predecessors, (6113), 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:42:02,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:02,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1515 of 1761 [2025-01-09 21:42:02,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:02,368 INFO L124 PetriNetUnfolderBase]: 0/981 cut-off events. [2025-01-09 21:42:02,368 INFO L125 PetriNetUnfolderBase]: For 1220/1220 co-relation queries the response was YES. [2025-01-09 21:42:02,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 981 events. 0/981 cut-off events. For 1220/1220 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 563 event pairs, 0 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 0. Up to 50 conditions per place. [2025-01-09 21:42:02,369 INFO L140 encePairwiseOnDemand]: 1757/1761 looper letters, 51 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2025-01-09 21:42:02,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 376 transitions, 1142 flow [2025-01-09 21:42:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6115 transitions. [2025-01-09 21:42:02,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868114707552527 [2025-01-09 21:42:02,371 INFO L175 Difference]: Start difference. First operand has 498 places, 377 transitions, 1036 flow. Second operand 4 states and 6115 transitions. [2025-01-09 21:42:02,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 376 transitions, 1142 flow [2025-01-09 21:42:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 376 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:02,375 INFO L231 Difference]: Finished difference. Result has 475 places, 376 transitions, 1039 flow [2025-01-09 21:42:02,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1761, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1039, PETRI_PLACES=475, PETRI_TRANSITIONS=376} [2025-01-09 21:42:02,376 INFO L279 CegarLoopForPetriNet]: 504 programPoint places, -29 predicate places. [2025-01-09 21:42:02,376 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 376 transitions, 1039 flow [2025-01-09 21:42:02,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1528.25) internal successors, (6113), 4 states have internal predecessors, (6113), 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:42:02,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:02,377 INFO L206 CegarLoopForPetriNet]: trace histogram [48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-01-09 21:42:02,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:02,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1651696929, now seen corresponding path program 1 times [2025-01-09 21:42:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:02,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820716364] [2025-01-09 21:42:02,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:02,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-01-09 21:42:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-01-09 21:42:02,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:02,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:02,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:02,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-01-09 21:42:02,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-01-09 21:42:02,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:02,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:02,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:02,749 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2025-01-09 21:42:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2025-01-09 21:42:02,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2025-01-09 21:42:02,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2025-01-09 21:42:02,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2025-01-09 21:42:02,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2025-01-09 21:42:02,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:02,752 WARN L246 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:02,752 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2025-01-09 21:42:02,882 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:02,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1844 places, 1797 transitions, 8490 flow [2025-01-09 21:42:03,707 INFO L124 PetriNetUnfolderBase]: 198/3115 cut-off events. [2025-01-09 21:42:03,707 INFO L125 PetriNetUnfolderBase]: For 19552/19552 co-relation queries the response was YES. [2025-01-09 21:42:03,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 3115 events. 198/3115 cut-off events. For 19552/19552 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8920 event pairs, 0 based on Foata normal form. 0/2766 useless extension candidates. Maximal degree in co-relation 4437. Up to 98 conditions per place. [2025-01-09 21:42:03,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 1844 places, 1797 transitions, 8490 flow [2025-01-09 21:42:03,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 513 places, 417 transitions, 3285 flow [2025-01-09 21:42:03,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:03,768 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:03,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-01-09 21:42:03,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:03,770 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:03,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:03,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:03,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:03,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash -483886580, now seen corresponding path program 1 times [2025-01-09 21:42:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517962748] [2025-01-09 21:42:03,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:03,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:03,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:03,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:03,839 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:42:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517962748] [2025-01-09 21:42:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517962748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423263332] [2025-01-09 21:42:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:03,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:03,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:03,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:03,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1496 out of 1797 [2025-01-09 21:42:03,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 417 transitions, 3285 flow. Second operand has 3 states, 3 states have (on average 1497.3333333333333) internal successors, (4492), 3 states have internal predecessors, (4492), 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:42:03,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:03,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1496 of 1797 [2025-01-09 21:42:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:04,783 INFO L124 PetriNetUnfolderBase]: 99/2427 cut-off events. [2025-01-09 21:42:04,783 INFO L125 PetriNetUnfolderBase]: For 20777/20777 co-relation queries the response was YES. [2025-01-09 21:42:04,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 2427 events. 99/2427 cut-off events. For 20777/20777 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6433 event pairs, 49 based on Foata normal form. 1/2227 useless extension candidates. Maximal degree in co-relation 3999. Up to 349 conditions per place. [2025-01-09 21:42:04,827 INFO L140 encePairwiseOnDemand]: 1792/1797 looper letters, 58 selfloop transitions, 2 changer transitions 1/414 dead transitions. [2025-01-09 21:42:04,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 414 transitions, 3399 flow [2025-01-09 21:42:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4551 transitions. [2025-01-09 21:42:04,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441847523650529 [2025-01-09 21:42:04,830 INFO L175 Difference]: Start difference. First operand has 513 places, 417 transitions, 3285 flow. Second operand 3 states and 4551 transitions. [2025-01-09 21:42:04,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 414 transitions, 3399 flow [2025-01-09 21:42:04,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 414 transitions, 1236 flow, removed 1081 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:04,860 INFO L231 Difference]: Finished difference. Result has 513 places, 413 transitions, 1118 flow [2025-01-09 21:42:04,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1797, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=513, PETRI_TRANSITIONS=413} [2025-01-09 21:42:04,860 INFO L279 CegarLoopForPetriNet]: 513 programPoint places, 0 predicate places. [2025-01-09 21:42:04,860 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 413 transitions, 1118 flow [2025-01-09 21:42:04,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1497.3333333333333) internal successors, (4492), 3 states have internal predecessors, (4492), 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:42:04,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:04,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:04,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-01-09 21:42:04,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:04,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1509369958, now seen corresponding path program 1 times [2025-01-09 21:42:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178613967] [2025-01-09 21:42:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:04,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:04,931 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:42:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178613967] [2025-01-09 21:42:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178613967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127607479] [2025-01-09 21:42:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:04,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:04,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:05,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1398 out of 1797 [2025-01-09 21:42:05,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 413 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 1399.0) internal successors, (4197), 3 states have internal predecessors, (4197), 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:42:05,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:05,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1398 of 1797 [2025-01-09 21:42:05,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:05,541 INFO L124 PetriNetUnfolderBase]: 50/2178 cut-off events. [2025-01-09 21:42:05,542 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2025-01-09 21:42:05,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2723 conditions, 2178 events. 50/2178 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4785 event pairs, 0 based on Foata normal form. 49/2128 useless extension candidates. Maximal degree in co-relation 2654. Up to 250 conditions per place. [2025-01-09 21:42:05,573 INFO L140 encePairwiseOnDemand]: 1791/1797 looper letters, 56 selfloop transitions, 1 changer transitions 24/408 dead transitions. [2025-01-09 21:42:05,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 408 transitions, 1226 flow [2025-01-09 21:42:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4258 transitions. [2025-01-09 21:42:05,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.789834910035244 [2025-01-09 21:42:05,575 INFO L175 Difference]: Start difference. First operand has 513 places, 413 transitions, 1118 flow. Second operand 3 states and 4258 transitions. [2025-01-09 21:42:05,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 408 transitions, 1226 flow [2025-01-09 21:42:05,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 408 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:05,583 INFO L231 Difference]: Finished difference. Result has 507 places, 384 transitions, 1056 flow [2025-01-09 21:42:05,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1797, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=507, PETRI_TRANSITIONS=384} [2025-01-09 21:42:05,583 INFO L279 CegarLoopForPetriNet]: 513 programPoint places, -6 predicate places. [2025-01-09 21:42:05,586 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 384 transitions, 1056 flow [2025-01-09 21:42:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1399.0) internal successors, (4197), 3 states have internal predecessors, (4197), 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:42:05,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:05,587 INFO L206 CegarLoopForPetriNet]: trace histogram [49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-01-09 21:42:05,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:05,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash -512213876, now seen corresponding path program 1 times [2025-01-09 21:42:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751458619] [2025-01-09 21:42:05,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:05,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 21:42:05,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 21:42:05,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:05,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:05,754 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:42:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751458619] [2025-01-09 21:42:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751458619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301373389] [2025-01-09 21:42:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:05,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:05,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:05,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:05,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1546 out of 1797 [2025-01-09 21:42:05,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 384 transitions, 1056 flow. Second operand has 4 states, 4 states have (on average 1559.5) internal successors, (6238), 4 states have internal predecessors, (6238), 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:42:05,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:05,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1546 of 1797 [2025-01-09 21:42:05,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:06,029 INFO L124 PetriNetUnfolderBase]: 0/1001 cut-off events. [2025-01-09 21:42:06,029 INFO L125 PetriNetUnfolderBase]: For 1270/1270 co-relation queries the response was YES. [2025-01-09 21:42:06,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 1001 events. 0/1001 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 576 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 0. Up to 51 conditions per place. [2025-01-09 21:42:06,030 INFO L140 encePairwiseOnDemand]: 1793/1797 looper letters, 52 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-01-09 21:42:06,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 383 transitions, 1164 flow [2025-01-09 21:42:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6240 transitions. [2025-01-09 21:42:06,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681135225375626 [2025-01-09 21:42:06,032 INFO L175 Difference]: Start difference. First operand has 507 places, 384 transitions, 1056 flow. Second operand 4 states and 6240 transitions. [2025-01-09 21:42:06,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 383 transitions, 1164 flow [2025-01-09 21:42:06,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 383 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:06,036 INFO L231 Difference]: Finished difference. Result has 484 places, 383 transitions, 1059 flow [2025-01-09 21:42:06,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1797, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1059, PETRI_PLACES=484, PETRI_TRANSITIONS=383} [2025-01-09 21:42:06,036 INFO L279 CegarLoopForPetriNet]: 513 programPoint places, -29 predicate places. [2025-01-09 21:42:06,036 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 383 transitions, 1059 flow [2025-01-09 21:42:06,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1559.5) internal successors, (6238), 4 states have internal predecessors, (6238), 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:42:06,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:06,037 INFO L206 CegarLoopForPetriNet]: trace histogram [49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:06,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-01-09 21:42:06,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -43984862, now seen corresponding path program 1 times [2025-01-09 21:42:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183161487] [2025-01-09 21:42:06,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:06,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-01-09 21:42:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-01-09 21:42:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:06,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:06,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-01-09 21:42:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-01-09 21:42:06,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:06,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:06,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2025-01-09 21:42:06,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2025-01-09 21:42:06,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2025-01-09 21:42:06,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2025-01-09 21:42:06,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2025-01-09 21:42:06,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2025-01-09 21:42:06,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:06,591 WARN L246 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:06,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2025-01-09 21:42:06,777 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:06,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1881 places, 1833 transitions, 8762 flow [2025-01-09 21:42:07,398 INFO L124 PetriNetUnfolderBase]: 202/3178 cut-off events. [2025-01-09 21:42:07,398 INFO L125 PetriNetUnfolderBase]: For 20776/20776 co-relation queries the response was YES. [2025-01-09 21:42:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 3178 events. 202/3178 cut-off events. For 20776/20776 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9192 event pairs, 0 based on Foata normal form. 0/2822 useless extension candidates. Maximal degree in co-relation 4552. Up to 100 conditions per place. [2025-01-09 21:42:07,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 1881 places, 1833 transitions, 8762 flow [2025-01-09 21:42:07,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 522 places, 424 transitions, 3399 flow [2025-01-09 21:42:07,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:07,461 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:07,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-01-09 21:42:07,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:07,462 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:07,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:07,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:07,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:07,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:07,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:07,462 INFO L85 PathProgramCache]: Analyzing trace with hash 144725484, now seen corresponding path program 1 times [2025-01-09 21:42:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129075752] [2025-01-09 21:42:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:07,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:07,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:07,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:07,512 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:42:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129075752] [2025-01-09 21:42:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129075752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:07,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860806360] [2025-01-09 21:42:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:07,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:07,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:07,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1526 out of 1833 [2025-01-09 21:42:07,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 424 transitions, 3399 flow. Second operand has 3 states, 3 states have (on average 1527.3333333333333) internal successors, (4582), 3 states have internal predecessors, (4582), 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:42:07,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:07,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1526 of 1833 [2025-01-09 21:42:07,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:08,201 INFO L124 PetriNetUnfolderBase]: 101/2476 cut-off events. [2025-01-09 21:42:08,201 INFO L125 PetriNetUnfolderBase]: For 22051/22051 co-relation queries the response was YES. [2025-01-09 21:42:08,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 2476 events. 101/2476 cut-off events. For 22051/22051 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6851 event pairs, 50 based on Foata normal form. 1/2272 useless extension candidates. Maximal degree in co-relation 4107. Up to 356 conditions per place. [2025-01-09 21:42:08,245 INFO L140 encePairwiseOnDemand]: 1828/1833 looper letters, 59 selfloop transitions, 2 changer transitions 1/421 dead transitions. [2025-01-09 21:42:08,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 421 transitions, 3515 flow [2025-01-09 21:42:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4642 transitions. [2025-01-09 21:42:08,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441534824513548 [2025-01-09 21:42:08,247 INFO L175 Difference]: Start difference. First operand has 522 places, 424 transitions, 3399 flow. Second operand 3 states and 4642 transitions. [2025-01-09 21:42:08,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 421 transitions, 3515 flow [2025-01-09 21:42:08,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 421 transitions, 1258 flow, removed 1128 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:08,278 INFO L231 Difference]: Finished difference. Result has 522 places, 420 transitions, 1138 flow [2025-01-09 21:42:08,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1833, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=522, PETRI_TRANSITIONS=420} [2025-01-09 21:42:08,278 INFO L279 CegarLoopForPetriNet]: 522 programPoint places, 0 predicate places. [2025-01-09 21:42:08,278 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 420 transitions, 1138 flow [2025-01-09 21:42:08,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1527.3333333333333) internal successors, (4582), 3 states have internal predecessors, (4582), 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:42:08,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:08,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:08,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-01-09 21:42:08,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:08,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash -582961725, now seen corresponding path program 1 times [2025-01-09 21:42:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496789800] [2025-01-09 21:42:08,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:08,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:08,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:08,327 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:42:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496789800] [2025-01-09 21:42:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496789800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047171873] [2025-01-09 21:42:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:08,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:08,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:08,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:08,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1426 out of 1833 [2025-01-09 21:42:08,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 420 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 1427.0) internal successors, (4281), 3 states have internal predecessors, (4281), 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:42:08,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:08,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1426 of 1833 [2025-01-09 21:42:08,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:08,934 INFO L124 PetriNetUnfolderBase]: 51/2222 cut-off events. [2025-01-09 21:42:08,935 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2025-01-09 21:42:08,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 2222 events. 51/2222 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 5034 event pairs, 0 based on Foata normal form. 50/2171 useless extension candidates. Maximal degree in co-relation 2708. Up to 255 conditions per place. [2025-01-09 21:42:08,966 INFO L140 encePairwiseOnDemand]: 1827/1833 looper letters, 57 selfloop transitions, 1 changer transitions 24/415 dead transitions. [2025-01-09 21:42:08,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 415 transitions, 1248 flow [2025-01-09 21:42:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4343 transitions. [2025-01-09 21:42:08,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.789779959992726 [2025-01-09 21:42:08,967 INFO L175 Difference]: Start difference. First operand has 522 places, 420 transitions, 1138 flow. Second operand 3 states and 4343 transitions. [2025-01-09 21:42:08,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 415 transitions, 1248 flow [2025-01-09 21:42:08,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 415 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:08,971 INFO L231 Difference]: Finished difference. Result has 516 places, 391 transitions, 1076 flow [2025-01-09 21:42:08,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1833, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=516, PETRI_TRANSITIONS=391} [2025-01-09 21:42:08,971 INFO L279 CegarLoopForPetriNet]: 522 programPoint places, -6 predicate places. [2025-01-09 21:42:08,971 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 391 transitions, 1076 flow [2025-01-09 21:42:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1427.0) internal successors, (4281), 3 states have internal predecessors, (4281), 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:42:08,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:08,972 INFO L206 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2025-01-09 21:42:08,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1556842353, now seen corresponding path program 1 times [2025-01-09 21:42:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:08,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533490889] [2025-01-09 21:42:08,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:08,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:09,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-01-09 21:42:09,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-01-09 21:42:09,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:09,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:09,106 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:42:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533490889] [2025-01-09 21:42:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533490889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:09,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44068725] [2025-01-09 21:42:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:09,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:09,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:09,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:09,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1577 out of 1833 [2025-01-09 21:42:09,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 391 transitions, 1076 flow. Second operand has 4 states, 4 states have (on average 1590.75) internal successors, (6363), 4 states have internal predecessors, (6363), 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:42:09,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:09,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1577 of 1833 [2025-01-09 21:42:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:09,421 INFO L124 PetriNetUnfolderBase]: 0/1021 cut-off events. [2025-01-09 21:42:09,421 INFO L125 PetriNetUnfolderBase]: For 1321/1321 co-relation queries the response was YES. [2025-01-09 21:42:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1021 events. 0/1021 cut-off events. For 1321/1321 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 588 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 0. Up to 52 conditions per place. [2025-01-09 21:42:09,422 INFO L140 encePairwiseOnDemand]: 1829/1833 looper letters, 53 selfloop transitions, 3 changer transitions 0/390 dead transitions. [2025-01-09 21:42:09,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 390 transitions, 1186 flow [2025-01-09 21:42:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6365 transitions. [2025-01-09 21:42:09,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681123840698309 [2025-01-09 21:42:09,425 INFO L175 Difference]: Start difference. First operand has 516 places, 391 transitions, 1076 flow. Second operand 4 states and 6365 transitions. [2025-01-09 21:42:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 390 transitions, 1186 flow [2025-01-09 21:42:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 390 transitions, 1185 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:09,429 INFO L231 Difference]: Finished difference. Result has 493 places, 390 transitions, 1079 flow [2025-01-09 21:42:09,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1833, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1079, PETRI_PLACES=493, PETRI_TRANSITIONS=390} [2025-01-09 21:42:09,429 INFO L279 CegarLoopForPetriNet]: 522 programPoint places, -29 predicate places. [2025-01-09 21:42:09,429 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 390 transitions, 1079 flow [2025-01-09 21:42:09,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1590.75) internal successors, (6363), 4 states have internal predecessors, (6363), 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:42:09,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:09,430 INFO L206 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:09,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-01-09 21:42:09,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 376304656, now seen corresponding path program 1 times [2025-01-09 21:42:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088196981] [2025-01-09 21:42:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:09,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 21:42:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 21:42:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:09,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 21:42:09,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 21:42:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:09,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:09,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2025-01-09 21:42:09,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 57 remaining) [2025-01-09 21:42:09,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2025-01-09 21:42:09,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2025-01-09 21:42:09,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-01-09 21:42:09,885 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:09,885 WARN L246 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:09,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2025-01-09 21:42:10,016 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:10,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1918 places, 1869 transitions, 9038 flow [2025-01-09 21:42:10,661 INFO L124 PetriNetUnfolderBase]: 206/3241 cut-off events. [2025-01-09 21:42:10,661 INFO L125 PetriNetUnfolderBase]: For 22050/22050 co-relation queries the response was YES. [2025-01-09 21:42:10,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 3241 events. 206/3241 cut-off events. For 22050/22050 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9283 event pairs, 0 based on Foata normal form. 0/2878 useless extension candidates. Maximal degree in co-relation 4668. Up to 102 conditions per place. [2025-01-09 21:42:10,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 1918 places, 1869 transitions, 9038 flow [2025-01-09 21:42:10,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 531 places, 431 transitions, 3515 flow [2025-01-09 21:42:10,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:10,727 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:10,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-09 21:42:10,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:10,728 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:10,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:10,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:10,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:10,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:10,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 5419340, now seen corresponding path program 1 times [2025-01-09 21:42:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215553569] [2025-01-09 21:42:10,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:10,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:10,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:10,779 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:42:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215553569] [2025-01-09 21:42:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215553569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285872055] [2025-01-09 21:42:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:10,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:10,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:10,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:10,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1556 out of 1869 [2025-01-09 21:42:10,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 431 transitions, 3515 flow. Second operand has 3 states, 3 states have (on average 1557.3333333333333) internal successors, (4672), 3 states have internal predecessors, (4672), 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:42:10,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:10,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1556 of 1869 [2025-01-09 21:42:10,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:11,490 INFO L124 PetriNetUnfolderBase]: 103/2525 cut-off events. [2025-01-09 21:42:11,490 INFO L125 PetriNetUnfolderBase]: For 23376/23376 co-relation queries the response was YES. [2025-01-09 21:42:11,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 2525 events. 103/2525 cut-off events. For 23376/23376 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7226 event pairs, 51 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 4216. Up to 363 conditions per place. [2025-01-09 21:42:11,536 INFO L140 encePairwiseOnDemand]: 1864/1869 looper letters, 60 selfloop transitions, 2 changer transitions 1/428 dead transitions. [2025-01-09 21:42:11,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 428 transitions, 3633 flow [2025-01-09 21:42:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4733 transitions. [2025-01-09 21:42:11,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.844123417157125 [2025-01-09 21:42:11,538 INFO L175 Difference]: Start difference. First operand has 531 places, 431 transitions, 3515 flow. Second operand 3 states and 4733 transitions. [2025-01-09 21:42:11,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 428 transitions, 3633 flow [2025-01-09 21:42:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 428 transitions, 1280 flow, removed 1176 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:11,568 INFO L231 Difference]: Finished difference. Result has 531 places, 427 transitions, 1158 flow [2025-01-09 21:42:11,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1869, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=531, PETRI_TRANSITIONS=427} [2025-01-09 21:42:11,568 INFO L279 CegarLoopForPetriNet]: 531 programPoint places, 0 predicate places. [2025-01-09 21:42:11,569 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 427 transitions, 1158 flow [2025-01-09 21:42:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1557.3333333333333) internal successors, (4672), 3 states have internal predecessors, (4672), 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:42:11,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:11,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-01-09 21:42:11,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1712033776, now seen corresponding path program 1 times [2025-01-09 21:42:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997695158] [2025-01-09 21:42:11,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:11,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:11,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:11,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:11,667 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:42:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997695158] [2025-01-09 21:42:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997695158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901287082] [2025-01-09 21:42:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:11,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:11,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:11,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1454 out of 1869 [2025-01-09 21:42:11,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 427 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 1455.0) internal successors, (4365), 3 states have internal predecessors, (4365), 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:42:11,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:11,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1454 of 1869 [2025-01-09 21:42:11,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:12,404 INFO L124 PetriNetUnfolderBase]: 52/2266 cut-off events. [2025-01-09 21:42:12,405 INFO L125 PetriNetUnfolderBase]: For 1374/1374 co-relation queries the response was YES. [2025-01-09 21:42:12,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 2266 events. 52/2266 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5387 event pairs, 0 based on Foata normal form. 51/2214 useless extension candidates. Maximal degree in co-relation 2762. Up to 260 conditions per place. [2025-01-09 21:42:12,441 INFO L140 encePairwiseOnDemand]: 1863/1869 looper letters, 58 selfloop transitions, 1 changer transitions 24/422 dead transitions. [2025-01-09 21:42:12,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 422 transitions, 1270 flow [2025-01-09 21:42:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4428 transitions. [2025-01-09 21:42:12,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7897271268057785 [2025-01-09 21:42:12,445 INFO L175 Difference]: Start difference. First operand has 531 places, 427 transitions, 1158 flow. Second operand 3 states and 4428 transitions. [2025-01-09 21:42:12,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 422 transitions, 1270 flow [2025-01-09 21:42:12,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 422 transitions, 1266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:12,450 INFO L231 Difference]: Finished difference. Result has 525 places, 398 transitions, 1096 flow [2025-01-09 21:42:12,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1869, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=525, PETRI_TRANSITIONS=398} [2025-01-09 21:42:12,450 INFO L279 CegarLoopForPetriNet]: 531 programPoint places, -6 predicate places. [2025-01-09 21:42:12,450 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 398 transitions, 1096 flow [2025-01-09 21:42:12,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1455.0) internal successors, (4365), 3 states have internal predecessors, (4365), 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:42:12,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:12,451 INFO L206 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2025-01-09 21:42:12,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 647450077, now seen corresponding path program 1 times [2025-01-09 21:42:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71540747] [2025-01-09 21:42:12,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:12,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 738 statements into 1 equivalence classes. [2025-01-09 21:42:12,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 738 of 738 statements. [2025-01-09 21:42:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:12,685 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:42:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71540747] [2025-01-09 21:42:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71540747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:12,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:12,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575043599] [2025-01-09 21:42:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:12,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:12,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:12,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1608 out of 1869 [2025-01-09 21:42:12,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 398 transitions, 1096 flow. Second operand has 4 states, 4 states have (on average 1622.0) internal successors, (6488), 4 states have internal predecessors, (6488), 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:42:12,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:12,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1608 of 1869 [2025-01-09 21:42:12,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:13,112 INFO L124 PetriNetUnfolderBase]: 0/1041 cut-off events. [2025-01-09 21:42:13,112 INFO L125 PetriNetUnfolderBase]: For 1373/1373 co-relation queries the response was YES. [2025-01-09 21:42:13,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1041 events. 0/1041 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 600 event pairs, 0 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 0. Up to 53 conditions per place. [2025-01-09 21:42:13,113 INFO L140 encePairwiseOnDemand]: 1865/1869 looper letters, 54 selfloop transitions, 3 changer transitions 0/397 dead transitions. [2025-01-09 21:42:13,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 397 transitions, 1208 flow [2025-01-09 21:42:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6490 transitions. [2025-01-09 21:42:13,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868111289459604 [2025-01-09 21:42:13,116 INFO L175 Difference]: Start difference. First operand has 525 places, 398 transitions, 1096 flow. Second operand 4 states and 6490 transitions. [2025-01-09 21:42:13,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 397 transitions, 1208 flow [2025-01-09 21:42:13,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 397 transitions, 1207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:13,120 INFO L231 Difference]: Finished difference. Result has 502 places, 397 transitions, 1099 flow [2025-01-09 21:42:13,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1869, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1099, PETRI_PLACES=502, PETRI_TRANSITIONS=397} [2025-01-09 21:42:13,120 INFO L279 CegarLoopForPetriNet]: 531 programPoint places, -29 predicate places. [2025-01-09 21:42:13,120 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 397 transitions, 1099 flow [2025-01-09 21:42:13,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1622.0) internal successors, (6488), 4 states have internal predecessors, (6488), 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:42:13,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:13,121 INFO L206 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-01-09 21:42:13,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:13,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1065903785, now seen corresponding path program 1 times [2025-01-09 21:42:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201187124] [2025-01-09 21:42:13,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:13,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-01-09 21:42:13,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-01-09 21:42:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:13,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:13,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-01-09 21:42:13,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-01-09 21:42:13,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:13,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:13,515 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2025-01-09 21:42:13,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2025-01-09 21:42:13,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2025-01-09 21:42:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2025-01-09 21:42:13,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:13,517 WARN L246 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:13,517 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2025-01-09 21:42:13,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:13,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1955 places, 1905 transitions, 9318 flow [2025-01-09 21:42:14,397 INFO L124 PetriNetUnfolderBase]: 210/3304 cut-off events. [2025-01-09 21:42:14,397 INFO L125 PetriNetUnfolderBase]: For 23375/23375 co-relation queries the response was YES. [2025-01-09 21:42:14,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 3304 events. 210/3304 cut-off events. For 23375/23375 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9570 event pairs, 0 based on Foata normal form. 0/2934 useless extension candidates. Maximal degree in co-relation 4785. Up to 104 conditions per place. [2025-01-09 21:42:14,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 1955 places, 1905 transitions, 9318 flow [2025-01-09 21:42:14,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 540 places, 438 transitions, 3633 flow [2025-01-09 21:42:14,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:14,459 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:14,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-09 21:42:14,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:14,460 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:14,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:14,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:14,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:14,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash -901805012, now seen corresponding path program 1 times [2025-01-09 21:42:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674622385] [2025-01-09 21:42:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:14,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:14,511 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:42:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674622385] [2025-01-09 21:42:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674622385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109638412] [2025-01-09 21:42:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:14,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:14,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:14,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1586 out of 1905 [2025-01-09 21:42:14,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 438 transitions, 3633 flow. Second operand has 3 states, 3 states have (on average 1587.3333333333333) internal successors, (4762), 3 states have internal predecessors, (4762), 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:42:14,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:14,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1586 of 1905 [2025-01-09 21:42:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:15,274 INFO L124 PetriNetUnfolderBase]: 105/2574 cut-off events. [2025-01-09 21:42:15,274 INFO L125 PetriNetUnfolderBase]: For 24753/24753 co-relation queries the response was YES. [2025-01-09 21:42:15,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 2574 events. 105/2574 cut-off events. For 24753/24753 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6880 event pairs, 52 based on Foata normal form. 1/2362 useless extension candidates. Maximal degree in co-relation 4326. Up to 370 conditions per place. [2025-01-09 21:42:15,323 INFO L140 encePairwiseOnDemand]: 1900/1905 looper letters, 61 selfloop transitions, 2 changer transitions 1/435 dead transitions. [2025-01-09 21:42:15,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 435 transitions, 3753 flow [2025-01-09 21:42:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4824 transitions. [2025-01-09 21:42:15,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8440944881889764 [2025-01-09 21:42:15,325 INFO L175 Difference]: Start difference. First operand has 540 places, 438 transitions, 3633 flow. Second operand 3 states and 4824 transitions. [2025-01-09 21:42:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 435 transitions, 3753 flow [2025-01-09 21:42:15,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 435 transitions, 1302 flow, removed 1225 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:15,357 INFO L231 Difference]: Finished difference. Result has 540 places, 434 transitions, 1178 flow [2025-01-09 21:42:15,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1905, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1178, PETRI_PLACES=540, PETRI_TRANSITIONS=434} [2025-01-09 21:42:15,358 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, 0 predicate places. [2025-01-09 21:42:15,358 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 434 transitions, 1178 flow [2025-01-09 21:42:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1587.3333333333333) internal successors, (4762), 3 states have internal predecessors, (4762), 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:42:15,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:15,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:15,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-01-09 21:42:15,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash -601618815, now seen corresponding path program 1 times [2025-01-09 21:42:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:15,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500457684] [2025-01-09 21:42:15,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:15,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:15,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:15,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:15,410 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:42:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500457684] [2025-01-09 21:42:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500457684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686188731] [2025-01-09 21:42:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:15,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:15,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1482 out of 1905 [2025-01-09 21:42:15,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 434 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 1483.0) internal successors, (4449), 3 states have internal predecessors, (4449), 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:42:15,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:15,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1482 of 1905 [2025-01-09 21:42:15,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:16,139 INFO L124 PetriNetUnfolderBase]: 53/2310 cut-off events. [2025-01-09 21:42:16,140 INFO L125 PetriNetUnfolderBase]: For 1427/1427 co-relation queries the response was YES. [2025-01-09 21:42:16,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 2310 events. 53/2310 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 5133 event pairs, 0 based on Foata normal form. 52/2257 useless extension candidates. Maximal degree in co-relation 2816. Up to 265 conditions per place. [2025-01-09 21:42:16,155 INFO L140 encePairwiseOnDemand]: 1899/1905 looper letters, 59 selfloop transitions, 1 changer transitions 24/429 dead transitions. [2025-01-09 21:42:16,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 429 transitions, 1292 flow [2025-01-09 21:42:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4513 transitions. [2025-01-09 21:42:16,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.789676290463692 [2025-01-09 21:42:16,157 INFO L175 Difference]: Start difference. First operand has 540 places, 434 transitions, 1178 flow. Second operand 3 states and 4513 transitions. [2025-01-09 21:42:16,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 429 transitions, 1292 flow [2025-01-09 21:42:16,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 429 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:16,160 INFO L231 Difference]: Finished difference. Result has 534 places, 405 transitions, 1116 flow [2025-01-09 21:42:16,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1905, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=534, PETRI_TRANSITIONS=405} [2025-01-09 21:42:16,161 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -6 predicate places. [2025-01-09 21:42:16,161 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 405 transitions, 1116 flow [2025-01-09 21:42:16,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1483.0) internal successors, (4449), 3 states have internal predecessors, (4449), 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:42:16,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:16,161 INFO L206 CegarLoopForPetriNet]: trace histogram [52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:16,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-01-09 21:42:16,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash 257537232, now seen corresponding path program 1 times [2025-01-09 21:42:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:16,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205375407] [2025-01-09 21:42:16,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-01-09 21:42:16,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-01-09 21:42:16,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:16,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:16,303 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:42:16,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205375407] [2025-01-09 21:42:16,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205375407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:16,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:16,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:16,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90996315] [2025-01-09 21:42:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:16,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:16,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:16,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:16,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1639 out of 1905 [2025-01-09 21:42:16,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 405 transitions, 1116 flow. Second operand has 4 states, 4 states have (on average 1653.25) internal successors, (6613), 4 states have internal predecessors, (6613), 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:42:16,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:16,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1639 of 1905 [2025-01-09 21:42:16,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:16,647 INFO L124 PetriNetUnfolderBase]: 0/1061 cut-off events. [2025-01-09 21:42:16,647 INFO L125 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2025-01-09 21:42:16,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1061 events. 0/1061 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 611 event pairs, 0 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 0. Up to 54 conditions per place. [2025-01-09 21:42:16,648 INFO L140 encePairwiseOnDemand]: 1901/1905 looper letters, 55 selfloop transitions, 3 changer transitions 0/404 dead transitions. [2025-01-09 21:42:16,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 404 transitions, 1230 flow [2025-01-09 21:42:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6615 transitions. [2025-01-09 21:42:16,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681102362204725 [2025-01-09 21:42:16,650 INFO L175 Difference]: Start difference. First operand has 534 places, 405 transitions, 1116 flow. Second operand 4 states and 6615 transitions. [2025-01-09 21:42:16,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 404 transitions, 1230 flow [2025-01-09 21:42:16,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 404 transitions, 1229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:16,654 INFO L231 Difference]: Finished difference. Result has 511 places, 404 transitions, 1119 flow [2025-01-09 21:42:16,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1905, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1119, PETRI_PLACES=511, PETRI_TRANSITIONS=404} [2025-01-09 21:42:16,654 INFO L279 CegarLoopForPetriNet]: 540 programPoint places, -29 predicate places. [2025-01-09 21:42:16,654 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 404 transitions, 1119 flow [2025-01-09 21:42:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1653.25) internal successors, (6613), 4 states have internal predecessors, (6613), 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:42:16,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:16,655 INFO L206 CegarLoopForPetriNet]: trace histogram [52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:16,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-01-09 21:42:16,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 280016877, now seen corresponding path program 1 times [2025-01-09 21:42:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676460718] [2025-01-09 21:42:16,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:16,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 21:42:16,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 21:42:16,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:16,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:16,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:16,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 21:42:16,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 21:42:16,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:16,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:17,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:17,070 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2025-01-09 21:42:17,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2025-01-09 21:42:17,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2025-01-09 21:42:17,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2025-01-09 21:42:17,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2025-01-09 21:42:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2025-01-09 21:42:17,073 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:17,073 WARN L246 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:17,073 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2025-01-09 21:42:17,219 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1992 places, 1941 transitions, 9602 flow [2025-01-09 21:42:18,021 INFO L124 PetriNetUnfolderBase]: 214/3367 cut-off events. [2025-01-09 21:42:18,021 INFO L125 PetriNetUnfolderBase]: For 24752/24752 co-relation queries the response was YES. [2025-01-09 21:42:18,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 3367 events. 214/3367 cut-off events. For 24752/24752 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9943 event pairs, 0 based on Foata normal form. 0/2990 useless extension candidates. Maximal degree in co-relation 4903. Up to 106 conditions per place. [2025-01-09 21:42:18,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 1992 places, 1941 transitions, 9602 flow [2025-01-09 21:42:18,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 549 places, 445 transitions, 3753 flow [2025-01-09 21:42:18,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:18,069 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:18,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-09 21:42:18,069 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:18,069 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:18,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:18,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:18,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:18,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:18,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1718019724, now seen corresponding path program 1 times [2025-01-09 21:42:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126962272] [2025-01-09 21:42:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:18,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:18,125 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:42:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126962272] [2025-01-09 21:42:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126962272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456053420] [2025-01-09 21:42:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:18,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:18,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:18,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:18,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1616 out of 1941 [2025-01-09 21:42:18,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 445 transitions, 3753 flow. Second operand has 3 states, 3 states have (on average 1617.3333333333333) internal successors, (4852), 3 states have internal predecessors, (4852), 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:42:18,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:18,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1616 of 1941 [2025-01-09 21:42:18,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:18,906 INFO L124 PetriNetUnfolderBase]: 107/2623 cut-off events. [2025-01-09 21:42:18,907 INFO L125 PetriNetUnfolderBase]: For 26183/26183 co-relation queries the response was YES. [2025-01-09 21:42:18,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 2623 events. 107/2623 cut-off events. For 26183/26183 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7231 event pairs, 53 based on Foata normal form. 1/2407 useless extension candidates. Maximal degree in co-relation 4437. Up to 377 conditions per place. [2025-01-09 21:42:18,957 INFO L140 encePairwiseOnDemand]: 1936/1941 looper letters, 62 selfloop transitions, 2 changer transitions 1/442 dead transitions. [2025-01-09 21:42:18,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 442 transitions, 3875 flow [2025-01-09 21:42:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4915 transitions. [2025-01-09 21:42:18,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8440666323201099 [2025-01-09 21:42:18,959 INFO L175 Difference]: Start difference. First operand has 549 places, 445 transitions, 3753 flow. Second operand 3 states and 4915 transitions. [2025-01-09 21:42:18,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 442 transitions, 3875 flow [2025-01-09 21:42:18,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 442 transitions, 1324 flow, removed 1275 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:18,991 INFO L231 Difference]: Finished difference. Result has 549 places, 441 transitions, 1198 flow [2025-01-09 21:42:18,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1941, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1198, PETRI_PLACES=549, PETRI_TRANSITIONS=441} [2025-01-09 21:42:18,992 INFO L279 CegarLoopForPetriNet]: 549 programPoint places, 0 predicate places. [2025-01-09 21:42:18,992 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 441 transitions, 1198 flow [2025-01-09 21:42:18,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1617.3333333333333) internal successors, (4852), 3 states have internal predecessors, (4852), 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:42:18,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:18,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:18,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-01-09 21:42:18,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1546684138, now seen corresponding path program 1 times [2025-01-09 21:42:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465304814] [2025-01-09 21:42:18,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:19,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:19,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:19,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:19,044 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:42:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465304814] [2025-01-09 21:42:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465304814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088236712] [2025-01-09 21:42:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:19,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:19,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:19,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1510 out of 1941 [2025-01-09 21:42:19,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 441 transitions, 1198 flow. Second operand has 3 states, 3 states have (on average 1511.0) internal successors, (4533), 3 states have internal predecessors, (4533), 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:42:19,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:19,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1510 of 1941 [2025-01-09 21:42:19,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:19,681 INFO L124 PetriNetUnfolderBase]: 54/2354 cut-off events. [2025-01-09 21:42:19,681 INFO L125 PetriNetUnfolderBase]: For 1481/1481 co-relation queries the response was YES. [2025-01-09 21:42:19,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 2354 events. 54/2354 cut-off events. For 1481/1481 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 5340 event pairs, 0 based on Foata normal form. 53/2300 useless extension candidates. Maximal degree in co-relation 2870. Up to 270 conditions per place. [2025-01-09 21:42:19,720 INFO L140 encePairwiseOnDemand]: 1935/1941 looper letters, 60 selfloop transitions, 1 changer transitions 24/436 dead transitions. [2025-01-09 21:42:19,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 436 transitions, 1314 flow [2025-01-09 21:42:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4598 transitions. [2025-01-09 21:42:19,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7896273398591791 [2025-01-09 21:42:19,722 INFO L175 Difference]: Start difference. First operand has 549 places, 441 transitions, 1198 flow. Second operand 3 states and 4598 transitions. [2025-01-09 21:42:19,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 436 transitions, 1314 flow [2025-01-09 21:42:19,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 436 transitions, 1310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:19,726 INFO L231 Difference]: Finished difference. Result has 543 places, 412 transitions, 1136 flow [2025-01-09 21:42:19,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1941, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=543, PETRI_TRANSITIONS=412} [2025-01-09 21:42:19,726 INFO L279 CegarLoopForPetriNet]: 549 programPoint places, -6 predicate places. [2025-01-09 21:42:19,726 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 412 transitions, 1136 flow [2025-01-09 21:42:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1511.0) internal successors, (4533), 3 states have internal predecessors, (4533), 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:42:19,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:19,727 INFO L206 CegarLoopForPetriNet]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2025-01-09 21:42:19,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:19,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1026027850, now seen corresponding path program 1 times [2025-01-09 21:42:19,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46631289] [2025-01-09 21:42:19,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:19,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-01-09 21:42:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-01-09 21:42:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:19,935 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:42:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46631289] [2025-01-09 21:42:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46631289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:42:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7977377] [2025-01-09 21:42:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:42:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:42:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:42:20,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1670 out of 1941 [2025-01-09 21:42:20,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 412 transitions, 1136 flow. Second operand has 4 states, 4 states have (on average 1684.5) internal successors, (6738), 4 states have internal predecessors, (6738), 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:42:20,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:20,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1670 of 1941 [2025-01-09 21:42:20,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:20,285 INFO L124 PetriNetUnfolderBase]: 0/1081 cut-off events. [2025-01-09 21:42:20,285 INFO L125 PetriNetUnfolderBase]: For 1480/1480 co-relation queries the response was YES. [2025-01-09 21:42:20,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1081 events. 0/1081 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 624 event pairs, 0 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 0. Up to 55 conditions per place. [2025-01-09 21:42:20,286 INFO L140 encePairwiseOnDemand]: 1937/1941 looper letters, 56 selfloop transitions, 3 changer transitions 0/411 dead transitions. [2025-01-09 21:42:20,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 411 transitions, 1252 flow [2025-01-09 21:42:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:42:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:42:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6740 transitions. [2025-01-09 21:42:20,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681092220504895 [2025-01-09 21:42:20,289 INFO L175 Difference]: Start difference. First operand has 543 places, 412 transitions, 1136 flow. Second operand 4 states and 6740 transitions. [2025-01-09 21:42:20,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 411 transitions, 1252 flow [2025-01-09 21:42:20,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 411 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:20,296 INFO L231 Difference]: Finished difference. Result has 520 places, 411 transitions, 1139 flow [2025-01-09 21:42:20,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1941, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1139, PETRI_PLACES=520, PETRI_TRANSITIONS=411} [2025-01-09 21:42:20,300 INFO L279 CegarLoopForPetriNet]: 549 programPoint places, -29 predicate places. [2025-01-09 21:42:20,300 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 411 transitions, 1139 flow [2025-01-09 21:42:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1684.5) internal successors, (6738), 4 states have internal predecessors, (6738), 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:42:20,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:20,301 INFO L206 CegarLoopForPetriNet]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2025-01-09 21:42:20,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1185152988, now seen corresponding path program 1 times [2025-01-09 21:42:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056567501] [2025-01-09 21:42:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:20,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-01-09 21:42:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-01-09 21:42:20,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:20,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:20,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-01-09 21:42:20,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-01-09 21:42:20,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:20,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:20,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:20,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:20,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 60 remaining) [2025-01-09 21:42:20,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-01-09 21:42:20,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-01-09 21:42:20,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-01-09 21:42:20,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-01-09 21:42:20,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-01-09 21:42:20,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-01-09 21:42:20,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2025-01-09 21:42:20,772 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:20,773 WARN L246 ceAbstractionStarter]: 52 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:20,773 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 53 thread instances. [2025-01-09 21:42:20,918 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 2029 places, 1977 transitions, 9890 flow [2025-01-09 21:42:21,654 INFO L124 PetriNetUnfolderBase]: 218/3430 cut-off events. [2025-01-09 21:42:21,655 INFO L125 PetriNetUnfolderBase]: For 26182/26182 co-relation queries the response was YES. [2025-01-09 21:42:21,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 3430 events. 218/3430 cut-off events. For 26182/26182 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 10049 event pairs, 0 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 5022. Up to 108 conditions per place. [2025-01-09 21:42:21,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 2029 places, 1977 transitions, 9890 flow [2025-01-09 21:42:21,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 558 places, 452 transitions, 3875 flow [2025-01-09 21:42:21,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:21,730 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:21,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-09 21:42:21,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:21,731 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-09 21:42:21,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:21,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:21,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:21,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:42:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -725041044, now seen corresponding path program 1 times [2025-01-09 21:42:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679553529] [2025-01-09 21:42:21,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:21,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:42:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:42:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:21,784 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:42:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679553529] [2025-01-09 21:42:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679553529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99412306] [2025-01-09 21:42:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:21,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:21,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:21,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:21,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1646 out of 1977 [2025-01-09 21:42:21,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 452 transitions, 3875 flow. Second operand has 3 states, 3 states have (on average 1647.3333333333333) internal successors, (4942), 3 states have internal predecessors, (4942), 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:42:21,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:21,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1646 of 1977 [2025-01-09 21:42:21,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:22,594 INFO L124 PetriNetUnfolderBase]: 109/2672 cut-off events. [2025-01-09 21:42:22,598 INFO L125 PetriNetUnfolderBase]: For 27667/27667 co-relation queries the response was YES. [2025-01-09 21:42:22,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 2672 events. 109/2672 cut-off events. For 27667/27667 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 7099 event pairs, 54 based on Foata normal form. 1/2452 useless extension candidates. Maximal degree in co-relation 4549. Up to 384 conditions per place. [2025-01-09 21:42:22,650 INFO L140 encePairwiseOnDemand]: 1972/1977 looper letters, 63 selfloop transitions, 2 changer transitions 1/449 dead transitions. [2025-01-09 21:42:22,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 449 transitions, 3999 flow [2025-01-09 21:42:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5006 transitions. [2025-01-09 21:42:22,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.844039790929017 [2025-01-09 21:42:22,652 INFO L175 Difference]: Start difference. First operand has 558 places, 452 transitions, 3875 flow. Second operand 3 states and 5006 transitions. [2025-01-09 21:42:22,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 449 transitions, 3999 flow [2025-01-09 21:42:22,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 449 transitions, 1346 flow, removed 1326 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:22,682 INFO L231 Difference]: Finished difference. Result has 558 places, 448 transitions, 1218 flow [2025-01-09 21:42:22,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1977, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=558, PETRI_TRANSITIONS=448} [2025-01-09 21:42:22,682 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, 0 predicate places. [2025-01-09 21:42:22,682 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 448 transitions, 1218 flow [2025-01-09 21:42:22,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1647.3333333333333) internal successors, (4942), 3 states have internal predecessors, (4942), 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:42:22,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:22,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:22,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2025-01-09 21:42:22,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-01-09 21:42:22,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -252262449, now seen corresponding path program 1 times [2025-01-09 21:42:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:22,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656983478] [2025-01-09 21:42:22,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:22,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 21:42:22,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 21:42:22,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:22,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:22,744 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:42:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656983478] [2025-01-09 21:42:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656983478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:22,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:22,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:22,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55666339] [2025-01-09 21:42:22,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:22,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:22,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:22,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:22,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:22,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1538 out of 1977 [2025-01-09 21:42:22,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 448 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 1539.0) internal successors, (4617), 3 states have internal predecessors, (4617), 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:42:22,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:22,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1538 of 1977 [2025-01-09 21:42:22,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand