./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:56:52,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:56:52,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:56:52,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:56:52,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:56:52,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:56:52,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:56:52,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:56:52,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:56:52,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:56:52,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:56:52,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:56:52,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:56:52,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:56:52,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:52,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:56:52,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:56:52,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:56:52,346 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/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 -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-03-13 21:56:52,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:56:52,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:56:52,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:56:52,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:56:52,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:56:52,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-03-13 21:56:53,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a8dda36/3dc1095e41b744d4a19eedca47684b04/FLAGc46ff897f [2025-03-13 21:56:54,039 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:56:54,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-03-13 21:56:54,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a8dda36/3dc1095e41b744d4a19eedca47684b04/FLAGc46ff897f [2025-03-13 21:56:54,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a8dda36/3dc1095e41b744d4a19eedca47684b04 [2025-03-13 21:56:54,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:56:54,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:56:54,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:54,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:56:54,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:56:54,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be86e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54, skipping insertion in model container [2025-03-13 21:56:54,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:56:54,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:54,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:56:54,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:54,873 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:56:54,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54 WrapperNode [2025-03-13 21:56:54,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:54,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:54,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:56:54,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:56:54,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,907 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-03-13 21:56:54,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:54,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:56:54,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:56:54,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:56:54,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:56:54,939 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:56:54,939 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:56:54,939 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:56:54,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (1/1) ... [2025-03-13 21:56:54,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:54,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:56:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-13 21:56:54,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-13 21:56:54,984 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:56:54,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:56:54,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:56:54,985 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:56:55,095 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:56:55,097 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:56:55,414 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-13 21:56:55,415 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-13 21:56:55,415 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-13 21:56:55,415 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-13 21:56:55,416 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:56:55,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:56:55,416 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:56:55,450 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:56:55,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:55 BoogieIcfgContainer [2025-03-13 21:56:55,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:56:55,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:56:55,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:56:55,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:56:55,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:56:54" (1/3) ... [2025-03-13 21:56:55,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5785eb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:55, skipping insertion in model container [2025-03-13 21:56:55,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:54" (2/3) ... [2025-03-13 21:56:55,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5785eb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:55, skipping insertion in model container [2025-03-13 21:56:55,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:55" (3/3) ... [2025-03-13 21:56:55,461 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-03-13 21:56:55,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:56:55,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 226 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-13 21:56:55,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:56:55,523 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:56:55,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 245 transitions, 510 flow [2025-03-13 21:56:55,672 INFO L124 PetriNetUnfolderBase]: 39/521 cut-off events. [2025-03-13 21:56:55,676 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:56:55,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 521 events. 39/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2094 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 277. Up to 8 conditions per place. [2025-03-13 21:56:55,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 245 transitions, 510 flow [2025-03-13 21:56:55,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 245 transitions, 510 flow [2025-03-13 21:56:55,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:56:55,711 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;@472706d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:56:55,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-13 21:56:55,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:56:55,716 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-13 21:56:55,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:55,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:55,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:55,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:55,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash 516903588, now seen corresponding path program 1 times [2025-03-13 21:56:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064333625] [2025-03-13 21:56:55,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:55,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:56:55,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:56:55,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:55,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064333625] [2025-03-13 21:56:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064333625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528648670] [2025-03-13 21:56:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:55,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:55,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-03-13 21:56:55,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 245 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:55,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:55,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-03-13 21:56:55,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,070 INFO L124 PetriNetUnfolderBase]: 63/811 cut-off events. [2025-03-13 21:56:56,071 INFO L125 PetriNetUnfolderBase]: For 90/142 co-relation queries the response was YES. [2025-03-13 21:56:56,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 811 events. 63/811 cut-off events. For 90/142 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4163 event pairs, 50 based on Foata normal form. 67/749 useless extension candidates. Maximal degree in co-relation 575. Up to 128 conditions per place. [2025-03-13 21:56:56,079 INFO L140 encePairwiseOnDemand]: 224/245 looper letters, 18 selfloop transitions, 1 changer transitions 6/223 dead transitions. [2025-03-13 21:56:56,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 504 flow [2025-03-13 21:56:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-03-13 21:56:56,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889795918367347 [2025-03-13 21:56:56,095 INFO L175 Difference]: Start difference. First operand has 232 places, 245 transitions, 510 flow. Second operand 3 states and 654 transitions. [2025-03-13 21:56:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 504 flow [2025-03-13 21:56:56,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:56:56,106 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 456 flow [2025-03-13 21:56:56,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-03-13 21:56:56,112 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -8 predicate places. [2025-03-13 21:56:56,113 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 456 flow [2025-03-13 21:56:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:56:56,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1155864173, now seen corresponding path program 1 times [2025-03-13 21:56:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031568971] [2025-03-13 21:56:56,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:56:56,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:56:56,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031568971] [2025-03-13 21:56:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031568971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:56,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:56,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:56,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541342334] [2025-03-13 21:56:56,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:56,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:56,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:56,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:56,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-03-13 21:56:56,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:56,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-03-13 21:56:56,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,382 INFO L124 PetriNetUnfolderBase]: 60/1400 cut-off events. [2025-03-13 21:56:56,382 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-13 21:56:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1400 events. 60/1400 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8932 event pairs, 28 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 754. Up to 51 conditions per place. [2025-03-13 21:56:56,388 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-03-13 21:56:56,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 536 flow [2025-03-13 21:56:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-03-13 21:56:56,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-03-13 21:56:56,391 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 456 flow. Second operand 3 states and 668 transitions. [2025-03-13 21:56:56,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 536 flow [2025-03-13 21:56:56,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 226 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:56,398 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 455 flow [2025-03-13 21:56:56,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2025-03-13 21:56:56,399 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -14 predicate places. [2025-03-13 21:56:56,399 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 455 flow [2025-03-13 21:56:56,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:56,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:56:56,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1472187683, now seen corresponding path program 1 times [2025-03-13 21:56:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699394735] [2025-03-13 21:56:56,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:56:56,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:56:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699394735] [2025-03-13 21:56:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699394735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313024555] [2025-03-13 21:56:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:56,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:56,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:56,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:56,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2025-03-13 21:56:56,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:56,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2025-03-13 21:56:56,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,613 INFO L124 PetriNetUnfolderBase]: 232/1677 cut-off events. [2025-03-13 21:56:56,613 INFO L125 PetriNetUnfolderBase]: For 202/506 co-relation queries the response was YES. [2025-03-13 21:56:56,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 1677 events. 232/1677 cut-off events. For 202/506 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11008 event pairs, 52 based on Foata normal form. 19/1489 useless extension candidates. Maximal degree in co-relation 1100. Up to 355 conditions per place. [2025-03-13 21:56:56,619 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 15 selfloop transitions, 1 changer transitions 24/220 dead transitions. [2025-03-13 21:56:56,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 529 flow [2025-03-13 21:56:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-13 21:56:56,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653061224489796 [2025-03-13 21:56:56,620 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 455 flow. Second operand 3 states and 636 transitions. [2025-03-13 21:56:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 529 flow [2025-03-13 21:56:56,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:56,624 INFO L231 Difference]: Finished difference. Result has 213 places, 192 transitions, 408 flow [2025-03-13 21:56:56,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=213, PETRI_TRANSITIONS=192} [2025-03-13 21:56:56,625 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -19 predicate places. [2025-03-13 21:56:56,625 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 192 transitions, 408 flow [2025-03-13 21:56:56,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:56,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:56:56,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:56,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1398667759, now seen corresponding path program 1 times [2025-03-13 21:56:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231056112] [2025-03-13 21:56:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:56:56,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:56:56,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231056112] [2025-03-13 21:56:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231056112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791273337] [2025-03-13 21:56:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:56,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:56,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:56,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:56,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-03-13 21:56:56,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 192 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:56,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-03-13 21:56:56,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,802 INFO L124 PetriNetUnfolderBase]: 184/1638 cut-off events. [2025-03-13 21:56:56,802 INFO L125 PetriNetUnfolderBase]: For 144/248 co-relation queries the response was YES. [2025-03-13 21:56:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1638 events. 184/1638 cut-off events. For 144/248 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11171 event pairs, 156 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1838. Up to 362 conditions per place. [2025-03-13 21:56:56,808 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-03-13 21:56:56,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 442 flow [2025-03-13 21:56:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-03-13 21:56:56,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693877551020408 [2025-03-13 21:56:56,810 INFO L175 Difference]: Start difference. First operand has 213 places, 192 transitions, 408 flow. Second operand 3 states and 639 transitions. [2025-03-13 21:56:56,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 442 flow [2025-03-13 21:56:56,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 189 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:56,814 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 409 flow [2025-03-13 21:56:56,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2025-03-13 21:56:56,815 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -39 predicate places. [2025-03-13 21:56:56,816 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 409 flow [2025-03-13 21:56:56,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:56:56,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash -820474083, now seen corresponding path program 1 times [2025-03-13 21:56:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719776064] [2025-03-13 21:56:56,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:56:56,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:56:56,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719776064] [2025-03-13 21:56:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719776064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:56,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:56,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500256413] [2025-03-13 21:56:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:56,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:56,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:56,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-03-13 21:56:56,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:56,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-03-13 21:56:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:57,009 INFO L124 PetriNetUnfolderBase]: 124/1385 cut-off events. [2025-03-13 21:56:57,009 INFO L125 PetriNetUnfolderBase]: For 144/248 co-relation queries the response was YES. [2025-03-13 21:56:57,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1385 events. 124/1385 cut-off events. For 144/248 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8850 event pairs, 96 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 868. Up to 250 conditions per place. [2025-03-13 21:56:57,017 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 17 selfloop transitions, 2 changer transitions 3/188 dead transitions. [2025-03-13 21:56:57,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 447 flow [2025-03-13 21:56:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-03-13 21:56:57,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-03-13 21:56:57,019 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 409 flow. Second operand 3 states and 642 transitions. [2025-03-13 21:56:57,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 447 flow [2025-03-13 21:56:57,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 188 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:56:57,022 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 405 flow [2025-03-13 21:56:57,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2025-03-13 21:56:57,023 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -38 predicate places. [2025-03-13 21:56:57,023 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 405 flow [2025-03-13 21:56:57,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:57,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:56:57,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash -285181283, now seen corresponding path program 1 times [2025-03-13 21:56:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222819116] [2025-03-13 21:56:57,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:57,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:56:57,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:56:57,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:57,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222819116] [2025-03-13 21:56:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222819116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:57,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140212895] [2025-03-13 21:56:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:57,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-03-13 21:56:57,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:57,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-03-13 21:56:57,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:57,192 INFO L124 PetriNetUnfolderBase]: 60/1200 cut-off events. [2025-03-13 21:56:57,192 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-13 21:56:57,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1200 events. 60/1200 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7076 event pairs, 28 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 696. Up to 51 conditions per place. [2025-03-13 21:56:57,198 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2025-03-13 21:56:57,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 485 flow [2025-03-13 21:56:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-03-13 21:56:57,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-03-13 21:56:57,200 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 405 flow. Second operand 3 states and 668 transitions. [2025-03-13 21:56:57,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 485 flow [2025-03-13 21:56:57,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:57,203 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 401 flow [2025-03-13 21:56:57,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=188, 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=401, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-03-13 21:56:57,203 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-03-13 21:56:57,204 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 401 flow [2025-03-13 21:56:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:57,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:57,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:56:57,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1112270852, now seen corresponding path program 1 times [2025-03-13 21:56:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823351397] [2025-03-13 21:56:57,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:57,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:56:57,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:56:57,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:57,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823351397] [2025-03-13 21:56:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823351397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018986497] [2025-03-13 21:56:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:57,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:57,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:57,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-03-13 21:56:57,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:57,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-03-13 21:56:57,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:57,401 INFO L124 PetriNetUnfolderBase]: 120/1323 cut-off events. [2025-03-13 21:56:57,401 INFO L125 PetriNetUnfolderBase]: For 150/270 co-relation queries the response was YES. [2025-03-13 21:56:57,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1323 events. 120/1323 cut-off events. For 150/270 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8433 event pairs, 92 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 835. Up to 234 conditions per place. [2025-03-13 21:56:57,407 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-03-13 21:56:57,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 439 flow [2025-03-13 21:56:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-03-13 21:56:57,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721088435374149 [2025-03-13 21:56:57,409 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 401 flow. Second operand 3 states and 641 transitions. [2025-03-13 21:56:57,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 439 flow [2025-03-13 21:56:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:57,413 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 402 flow [2025-03-13 21:56:57,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=188, 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=402, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2025-03-13 21:56:57,414 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-03-13 21:56:57,414 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 402 flow [2025-03-13 21:56:57,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:57,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:57,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:56:57,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:57,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash -276047459, now seen corresponding path program 1 times [2025-03-13 21:56:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:57,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581595226] [2025-03-13 21:56:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:57,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:56:57,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:56:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581595226] [2025-03-13 21:56:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581595226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:56:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809301083] [2025-03-13 21:56:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:57,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 245 [2025-03-13 21:56:57,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:57,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 245 [2025-03-13 21:56:57,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:57,574 INFO L124 PetriNetUnfolderBase]: 58/1187 cut-off events. [2025-03-13 21:56:57,575 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-13 21:56:57,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1187 events. 58/1187 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7006 event pairs, 28 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 706. Up to 110 conditions per place. [2025-03-13 21:56:57,580 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 16 selfloop transitions, 0 changer transitions 1/182 dead transitions. [2025-03-13 21:56:57,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 182 transitions, 431 flow [2025-03-13 21:56:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-03-13 21:56:57,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-03-13 21:56:57,581 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 402 flow. Second operand 3 states and 642 transitions. [2025-03-13 21:56:57,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 182 transitions, 431 flow [2025-03-13 21:56:57,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-13 21:56:57,584 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 389 flow [2025-03-13 21:56:57,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2025-03-13 21:56:57,585 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -43 predicate places. [2025-03-13 21:56:57,585 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 389 flow [2025-03-13 21:56:57,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:57,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:56:57,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1665365460, now seen corresponding path program 1 times [2025-03-13 21:56:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853723705] [2025-03-13 21:56:57,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:57,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 21:56:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 21:56:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:57,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:57,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853723705] [2025-03-13 21:56:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853723705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422787515] [2025-03-13 21:56:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:57,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:57,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:58,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 245 [2025-03-13 21:56:58,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:58,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 245 [2025-03-13 21:56:58,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:58,357 INFO L124 PetriNetUnfolderBase]: 652/3659 cut-off events. [2025-03-13 21:56:58,357 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-03-13 21:56:58,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3659 events. 652/3659 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31708 event pairs, 296 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 5175. Up to 1255 conditions per place. [2025-03-13 21:56:58,371 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 44 selfloop transitions, 5 changer transitions 4/188 dead transitions. [2025-03-13 21:56:58,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 503 flow [2025-03-13 21:56:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:56:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:56:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-03-13 21:56:58,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7816326530612245 [2025-03-13 21:56:58,375 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 389 flow. Second operand 6 states and 1149 transitions. [2025-03-13 21:56:58,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 503 flow [2025-03-13 21:56:58,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:58,378 INFO L231 Difference]: Finished difference. Result has 191 places, 176 transitions, 387 flow [2025-03-13 21:56:58,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=176} [2025-03-13 21:56:58,380 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -41 predicate places. [2025-03-13 21:56:58,380 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 176 transitions, 387 flow [2025-03-13 21:56:58,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:58,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:58,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:56:58,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 996998862, now seen corresponding path program 1 times [2025-03-13 21:56:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008093609] [2025-03-13 21:56:58,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:58,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:56:58,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:56:58,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:58,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008093609] [2025-03-13 21:56:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008093609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:56:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418803658] [2025-03-13 21:56:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:56:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:58,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:56:58,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:56:58,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2025-03-13 21:56:58,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 176 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:58,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2025-03-13 21:56:58,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:58,684 INFO L124 PetriNetUnfolderBase]: 159/1512 cut-off events. [2025-03-13 21:56:58,684 INFO L125 PetriNetUnfolderBase]: For 114/216 co-relation queries the response was YES. [2025-03-13 21:56:58,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1512 events. 159/1512 cut-off events. For 114/216 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10362 event pairs, 120 based on Foata normal form. 11/1351 useless extension candidates. Maximal degree in co-relation 1963. Up to 209 conditions per place. [2025-03-13 21:56:58,690 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 42 selfloop transitions, 10 changer transitions 0/204 dead transitions. [2025-03-13 21:56:58,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 204 transitions, 571 flow [2025-03-13 21:56:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:56:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:56:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 866 transitions. [2025-03-13 21:56:58,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836734693877552 [2025-03-13 21:56:58,693 INFO L175 Difference]: Start difference. First operand has 191 places, 176 transitions, 387 flow. Second operand 4 states and 866 transitions. [2025-03-13 21:56:58,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 204 transitions, 571 flow [2025-03-13 21:56:58,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 561 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:56:58,695 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 451 flow [2025-03-13 21:56:58,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-03-13 21:56:58,696 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -45 predicate places. [2025-03-13 21:56:58,696 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 451 flow [2025-03-13 21:56:58,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:58,697 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:58,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:56:58,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-13 21:56:58,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -474781735, now seen corresponding path program 1 times [2025-03-13 21:56:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515831073] [2025-03-13 21:56:58,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:58,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 21:56:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 21:56:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:56:58,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:56:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 21:56:58,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 21:56:58,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:58,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:56:58,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:56:58,757 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:56:58,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-03-13 21:56:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-03-13 21:56:58,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-03-13 21:56:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:56:58,760 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:58,762 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:56:58,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:56:58,788 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-13 21:56:58,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 600 flow [2025-03-13 21:56:58,888 INFO L124 PetriNetUnfolderBase]: 155/1630 cut-off events. [2025-03-13 21:56:58,888 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-13 21:56:58,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1630 events. 155/1630 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9453 event pairs, 1 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 942. Up to 32 conditions per place. [2025-03-13 21:56:58,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 600 flow [2025-03-13 21:56:58,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 278 transitions, 600 flow [2025-03-13 21:56:58,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:56:58,900 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;@472706d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:56:58,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-13 21:56:58,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:56:58,902 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-13 21:56:58,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:58,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:58,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:58,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:56:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1909681464, now seen corresponding path program 1 times [2025-03-13 21:56:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435579067] [2025-03-13 21:56:58,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:58,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:56:58,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:56:58,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435579067] [2025-03-13 21:56:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435579067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:58,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778957390] [2025-03-13 21:56:58,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:58,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:58,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:58,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:58,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-03-13 21:56:58,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:58,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-03-13 21:56:58,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:59,836 INFO L124 PetriNetUnfolderBase]: 2218/10556 cut-off events. [2025-03-13 21:56:59,838 INFO L125 PetriNetUnfolderBase]: For 2527/5596 co-relation queries the response was YES. [2025-03-13 21:56:59,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14543 conditions, 10556 events. 2218/10556 cut-off events. For 2527/5596 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 112719 event pairs, 1905 based on Foata normal form. 1203/10033 useless extension candidates. Maximal degree in co-relation 9437. Up to 3249 conditions per place. [2025-03-13 21:56:59,902 INFO L140 encePairwiseOnDemand]: 251/278 looper letters, 28 selfloop transitions, 1 changer transitions 4/248 dead transitions. [2025-03-13 21:56:59,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 598 flow [2025-03-13 21:56:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-13 21:56:59,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609112709832134 [2025-03-13 21:56:59,904 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 600 flow. Second operand 3 states and 718 transitions. [2025-03-13 21:56:59,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 598 flow [2025-03-13 21:56:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:56:59,913 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 534 flow [2025-03-13 21:56:59,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-03-13 21:56:59,914 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -14 predicate places. [2025-03-13 21:56:59,914 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 534 flow [2025-03-13 21:56:59,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:59,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:59,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:56:59,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:56:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash -929422701, now seen corresponding path program 1 times [2025-03-13 21:56:59,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:59,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150208528] [2025-03-13 21:56:59,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:59,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:56:59,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:56:59,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:59,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150208528] [2025-03-13 21:56:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150208528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476835229] [2025-03-13 21:56:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:59,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:59,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:59,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-03-13 21:56:59,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:59,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:59,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-03-13 21:56:59,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:01,738 INFO L124 PetriNetUnfolderBase]: 2492/17972 cut-off events. [2025-03-13 21:57:01,739 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-13 21:57:01,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22939 conditions, 17972 events. 2492/17972 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 226052 event pairs, 1706 based on Foata normal form. 0/14727 useless extension candidates. Maximal degree in co-relation 11439. Up to 1670 conditions per place. [2025-03-13 21:57:01,938 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2025-03-13 21:57:01,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 263 transitions, 696 flow [2025-03-13 21:57:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-03-13 21:57:01,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-03-13 21:57:01,941 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 534 flow. Second operand 3 states and 736 transitions. [2025-03-13 21:57:01,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 263 transitions, 696 flow [2025-03-13 21:57:01,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 263 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:01,946 INFO L231 Difference]: Finished difference. Result has 245 places, 243 transitions, 533 flow [2025-03-13 21:57:01,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=245, PETRI_TRANSITIONS=243} [2025-03-13 21:57:01,951 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -18 predicate places. [2025-03-13 21:57:01,951 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 243 transitions, 533 flow [2025-03-13 21:57:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:01,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:01,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:57:01,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1252530929, now seen corresponding path program 1 times [2025-03-13 21:57:01,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:01,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616608438] [2025-03-13 21:57:01,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:01,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:57:01,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:57:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:01,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-03-13 21:57:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616608438] [2025-03-13 21:57:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616608438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:01,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:01,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994418044] [2025-03-13 21:57:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:01,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:01,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:02,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 278 [2025-03-13 21:57:02,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:02,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:02,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 278 [2025-03-13 21:57:02,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:05,458 INFO L124 PetriNetUnfolderBase]: 14770/42373 cut-off events. [2025-03-13 21:57:05,458 INFO L125 PetriNetUnfolderBase]: For 9226/47382 co-relation queries the response was YES. [2025-03-13 21:57:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66312 conditions, 42373 events. 14770/42373 cut-off events. For 9226/47382 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 495833 event pairs, 4272 based on Foata normal form. 121/37401 useless extension candidates. Maximal degree in co-relation 33152. Up to 17809 conditions per place. [2025-03-13 21:57:05,782 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 41 selfloop transitions, 2 changer transitions 18/258 dead transitions. [2025-03-13 21:57:05,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 258 transitions, 702 flow [2025-03-13 21:57:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-13 21:57:05,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-03-13 21:57:05,785 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 533 flow. Second operand 3 states and 701 transitions. [2025-03-13 21:57:05,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 258 transitions, 702 flow [2025-03-13 21:57:05,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 258 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:05,798 INFO L231 Difference]: Finished difference. Result has 240 places, 223 transitions, 502 flow [2025-03-13 21:57:05,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=223} [2025-03-13 21:57:05,802 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -23 predicate places. [2025-03-13 21:57:05,802 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 223 transitions, 502 flow [2025-03-13 21:57:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:05,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:05,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:05,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:57:05,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1420843941, now seen corresponding path program 1 times [2025-03-13 21:57:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384319029] [2025-03-13 21:57:05,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:05,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:57:05,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:57:05,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:05,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384319029] [2025-03-13 21:57:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384319029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660722077] [2025-03-13 21:57:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:05,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:05,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:05,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-03-13 21:57:05,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 223 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:05,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:05,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-03-13 21:57:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:07,822 INFO L124 PetriNetUnfolderBase]: 6096/23780 cut-off events. [2025-03-13 21:57:07,822 INFO L125 PetriNetUnfolderBase]: For 4746/11286 co-relation queries the response was YES. [2025-03-13 21:57:07,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35749 conditions, 23780 events. 6096/23780 cut-off events. For 4746/11286 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 277243 event pairs, 5210 based on Foata normal form. 0/21026 useless extension candidates. Maximal degree in co-relation 28670. Up to 8524 conditions per place. [2025-03-13 21:57:07,949 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 28 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-13 21:57:07,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 556 flow [2025-03-13 21:57:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2025-03-13 21:57:07,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357314148681055 [2025-03-13 21:57:07,952 INFO L175 Difference]: Start difference. First operand has 240 places, 223 transitions, 502 flow. Second operand 3 states and 697 transitions. [2025-03-13 21:57:07,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 556 flow [2025-03-13 21:57:07,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:07,956 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 504 flow [2025-03-13 21:57:07,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-03-13 21:57:07,957 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -39 predicate places. [2025-03-13 21:57:07,957 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 504 flow [2025-03-13 21:57:07,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:07,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:07,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:07,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:57:07,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:07,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1394085327, now seen corresponding path program 1 times [2025-03-13 21:57:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549299687] [2025-03-13 21:57:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:57:07,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:57:07,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:07,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549299687] [2025-03-13 21:57:07,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549299687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:07,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:07,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:07,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059633720] [2025-03-13 21:57:07,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:07,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:07,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:07,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:07,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-03-13 21:57:07,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:07,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:07,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-03-13 21:57:07,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:09,764 INFO L124 PetriNetUnfolderBase]: 4656/19695 cut-off events. [2025-03-13 21:57:09,765 INFO L125 PetriNetUnfolderBase]: For 4754/12902 co-relation queries the response was YES. [2025-03-13 21:57:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29201 conditions, 19695 events. 4656/19695 cut-off events. For 4754/12902 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 229356 event pairs, 3782 based on Foata normal form. 0/16702 useless extension candidates. Maximal degree in co-relation 24021. Up to 6578 conditions per place. [2025-03-13 21:57:09,869 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 28 selfloop transitions, 2 changer transitions 2/219 dead transitions. [2025-03-13 21:57:09,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 562 flow [2025-03-13 21:57:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-03-13 21:57:09,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-03-13 21:57:09,875 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 504 flow. Second operand 3 states and 700 transitions. [2025-03-13 21:57:09,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 562 flow [2025-03-13 21:57:09,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 219 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:09,886 INFO L231 Difference]: Finished difference. Result has 225 places, 217 transitions, 502 flow [2025-03-13 21:57:09,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=225, PETRI_TRANSITIONS=217} [2025-03-13 21:57:09,886 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -38 predicate places. [2025-03-13 21:57:09,886 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 217 transitions, 502 flow [2025-03-13 21:57:09,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:09,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:09,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:09,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:57:09,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash 119719473, now seen corresponding path program 1 times [2025-03-13 21:57:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43106738] [2025-03-13 21:57:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:09,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:57:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:57:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43106738] [2025-03-13 21:57:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43106738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82661419] [2025-03-13 21:57:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:09,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:09,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:09,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:09,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-03-13 21:57:09,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:09,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:09,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-03-13 21:57:09,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:11,355 INFO L124 PetriNetUnfolderBase]: 2546/16004 cut-off events. [2025-03-13 21:57:11,355 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-13 21:57:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 16004 events. 2546/16004 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 192526 event pairs, 1706 based on Foata normal form. 0/13616 useless extension candidates. Maximal degree in co-relation 19193. Up to 1670 conditions per place. [2025-03-13 21:57:11,427 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2025-03-13 21:57:11,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 236 transitions, 664 flow [2025-03-13 21:57:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-03-13 21:57:11,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-03-13 21:57:11,428 INFO L175 Difference]: Start difference. First operand has 225 places, 217 transitions, 502 flow. Second operand 3 states and 736 transitions. [2025-03-13 21:57:11,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 236 transitions, 664 flow [2025-03-13 21:57:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 236 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:11,432 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 498 flow [2025-03-13 21:57:11,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2025-03-13 21:57:11,433 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-03-13 21:57:11,433 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 498 flow [2025-03-13 21:57:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:11,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:11,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:57:11,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1921574140, now seen corresponding path program 1 times [2025-03-13 21:57:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:11,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429940741] [2025-03-13 21:57:11,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:11,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:57:11,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:57:11,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:11,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429940741] [2025-03-13 21:57:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429940741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:11,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:11,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536956929] [2025-03-13 21:57:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:11,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:11,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:11,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-03-13 21:57:11,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:11,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:11,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-03-13 21:57:11,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:13,224 INFO L124 PetriNetUnfolderBase]: 5342/21325 cut-off events. [2025-03-13 21:57:13,225 INFO L125 PetriNetUnfolderBase]: For 4784/13692 co-relation queries the response was YES. [2025-03-13 21:57:13,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 21325 events. 5342/21325 cut-off events. For 4784/13692 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 250635 event pairs, 4482 based on Foata normal form. 0/18118 useless extension candidates. Maximal degree in co-relation 25846. Up to 7458 conditions per place. [2025-03-13 21:57:13,540 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 29 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-03-13 21:57:13,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 558 flow [2025-03-13 21:57:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-03-13 21:57:13,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-03-13 21:57:13,542 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 498 flow. Second operand 3 states and 700 transitions. [2025-03-13 21:57:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 558 flow [2025-03-13 21:57:13,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 215 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:13,547 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 499 flow [2025-03-13 21:57:13,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2025-03-13 21:57:13,548 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-03-13 21:57:13,548 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 499 flow [2025-03-13 21:57:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:13,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:13,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:57:13,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -109089251, now seen corresponding path program 1 times [2025-03-13 21:57:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605063050] [2025-03-13 21:57:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:57:13,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:57:13,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:13,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:13,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605063050] [2025-03-13 21:57:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605063050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559122014] [2025-03-13 21:57:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:13,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:13,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:13,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 278 [2025-03-13 21:57:13,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:13,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:13,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 278 [2025-03-13 21:57:13,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:15,049 INFO L124 PetriNetUnfolderBase]: 3752/19495 cut-off events. [2025-03-13 21:57:15,050 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-13 21:57:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 19495 events. 3752/19495 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 235786 event pairs, 2730 based on Foata normal form. 2/16460 useless extension candidates. Maximal degree in co-relation 23378. Up to 5036 conditions per place. [2025-03-13 21:57:15,150 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 27 selfloop transitions, 0 changer transitions 1/214 dead transitions. [2025-03-13 21:57:15,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 214 transitions, 550 flow [2025-03-13 21:57:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-13 21:57:15,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-03-13 21:57:15,152 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 499 flow. Second operand 3 states and 701 transitions. [2025-03-13 21:57:15,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 214 transitions, 550 flow [2025-03-13 21:57:15,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 214 transitions, 542 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-13 21:57:15,157 INFO L231 Difference]: Finished difference. Result has 221 places, 213 transitions, 486 flow [2025-03-13 21:57:15,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2025-03-13 21:57:15,158 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -42 predicate places. [2025-03-13 21:57:15,158 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 486 flow [2025-03-13 21:57:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:15,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:15,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:15,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:57:15,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1945485288, now seen corresponding path program 1 times [2025-03-13 21:57:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691465477] [2025-03-13 21:57:15,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:15,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 21:57:15,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 21:57:15,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691465477] [2025-03-13 21:57:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691465477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612678251] [2025-03-13 21:57:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:15,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-03-13 21:57:15,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:15,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-03-13 21:57:15,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:21,401 INFO L124 PetriNetUnfolderBase]: 21016/72675 cut-off events. [2025-03-13 21:57:21,401 INFO L125 PetriNetUnfolderBase]: For 3200/3342 co-relation queries the response was YES. [2025-03-13 21:57:21,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111202 conditions, 72675 events. 21016/72675 cut-off events. For 3200/3342 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 962553 event pairs, 9754 based on Foata normal form. 0/66430 useless extension candidates. Maximal degree in co-relation 111193. Up to 29941 conditions per place. [2025-03-13 21:57:21,759 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 64 selfloop transitions, 5 changer transitions 3/228 dead transitions. [2025-03-13 21:57:21,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 656 flow [2025-03-13 21:57:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-13 21:57:21,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583932853717026 [2025-03-13 21:57:21,762 INFO L175 Difference]: Start difference. First operand has 221 places, 213 transitions, 486 flow. Second operand 6 states and 1265 transitions. [2025-03-13 21:57:21,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 656 flow [2025-03-13 21:57:21,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 654 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:21,771 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 486 flow [2025-03-13 21:57:21,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2025-03-13 21:57:21,772 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -40 predicate places. [2025-03-13 21:57:21,772 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 486 flow [2025-03-13 21:57:21,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:21,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:21,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:21,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:57:21,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1215970334, now seen corresponding path program 1 times [2025-03-13 21:57:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751266492] [2025-03-13 21:57:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:21,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:57:21,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:57:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751266492] [2025-03-13 21:57:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751266492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:21,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:21,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:57:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552685764] [2025-03-13 21:57:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:57:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:21,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:57:21,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:57:21,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 278 [2025-03-13 21:57:21,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:21,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:21,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 278 [2025-03-13 21:57:21,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:24,471 INFO L124 PetriNetUnfolderBase]: 7222/29018 cut-off events. [2025-03-13 21:57:24,471 INFO L125 PetriNetUnfolderBase]: For 4098/8924 co-relation queries the response was YES. [2025-03-13 21:57:24,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43101 conditions, 29018 events. 7222/29018 cut-off events. For 4098/8924 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 354227 event pairs, 5043 based on Foata normal form. 137/25721 useless extension candidates. Maximal degree in co-relation 43092. Up to 5892 conditions per place. [2025-03-13 21:57:24,620 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 77 selfloop transitions, 11 changer transitions 0/262 dead transitions. [2025-03-13 21:57:24,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 262 transitions, 832 flow [2025-03-13 21:57:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:57:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:57:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2025-03-13 21:57:24,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8687050359712231 [2025-03-13 21:57:24,622 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 486 flow. Second operand 4 states and 966 transitions. [2025-03-13 21:57:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 262 transitions, 832 flow [2025-03-13 21:57:24,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 822 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:24,632 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 558 flow [2025-03-13 21:57:24,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-03-13 21:57:24,633 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -43 predicate places. [2025-03-13 21:57:24,633 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 558 flow [2025-03-13 21:57:24,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:24,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:24,634 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:24,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:57:24,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2070094138, now seen corresponding path program 1 times [2025-03-13 21:57:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143648386] [2025-03-13 21:57:24,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:24,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 21:57:24,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 21:57:24,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:24,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143648386] [2025-03-13 21:57:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143648386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:57:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425165045] [2025-03-13 21:57:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:24,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:24,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:24,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:24,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 278 [2025-03-13 21:57:24,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:24,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:24,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 278 [2025-03-13 21:57:24,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:27,812 INFO L124 PetriNetUnfolderBase]: 8170/32850 cut-off events. [2025-03-13 21:57:27,812 INFO L125 PetriNetUnfolderBase]: For 7354/8940 co-relation queries the response was YES. [2025-03-13 21:57:27,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51732 conditions, 32850 events. 8170/32850 cut-off events. For 7354/8940 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 409326 event pairs, 5344 based on Foata normal form. 3/29337 useless extension candidates. Maximal degree in co-relation 51721. Up to 6739 conditions per place. [2025-03-13 21:57:27,940 INFO L140 encePairwiseOnDemand]: 262/278 looper letters, 96 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2025-03-13 21:57:27,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 283 transitions, 994 flow [2025-03-13 21:57:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:57:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:57:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1619 transitions. [2025-03-13 21:57:27,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319630010277492 [2025-03-13 21:57:27,942 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 558 flow. Second operand 7 states and 1619 transitions. [2025-03-13 21:57:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 283 transitions, 994 flow [2025-03-13 21:57:27,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 283 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:27,948 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 650 flow [2025-03-13 21:57:27,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-03-13 21:57:27,949 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -34 predicate places. [2025-03-13 21:57:27,949 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 650 flow [2025-03-13 21:57:27,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:27,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:27,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:57:27,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2051350879, now seen corresponding path program 1 times [2025-03-13 21:57:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002265149] [2025-03-13 21:57:27,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:27,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-13 21:57:27,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-13 21:57:27,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:27,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002265149] [2025-03-13 21:57:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002265149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301819142] [2025-03-13 21:57:28,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:28,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-03-13 21:57:28,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:28,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:28,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-03-13 21:57:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:33,113 INFO L124 PetriNetUnfolderBase]: 21085/50774 cut-off events. [2025-03-13 21:57:33,113 INFO L125 PetriNetUnfolderBase]: For 11053/11057 co-relation queries the response was YES. [2025-03-13 21:57:33,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89533 conditions, 50774 events. 21085/50774 cut-off events. For 11053/11057 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 530702 event pairs, 9342 based on Foata normal form. 0/47723 useless extension candidates. Maximal degree in co-relation 89518. Up to 25899 conditions per place. [2025-03-13 21:57:33,398 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 91 selfloop transitions, 6 changer transitions 0/255 dead transitions. [2025-03-13 21:57:33,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 255 transitions, 906 flow [2025-03-13 21:57:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1281 transitions. [2025-03-13 21:57:33,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7679856115107914 [2025-03-13 21:57:33,400 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 650 flow. Second operand 6 states and 1281 transitions. [2025-03-13 21:57:33,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 255 transitions, 906 flow [2025-03-13 21:57:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 255 transitions, 880 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:57:33,423 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 634 flow [2025-03-13 21:57:33,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-03-13 21:57:33,424 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -33 predicate places. [2025-03-13 21:57:33,424 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 634 flow [2025-03-13 21:57:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:33,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:33,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:33,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:57:33,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-13 21:57:33,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash 616714660, now seen corresponding path program 1 times [2025-03-13 21:57:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135527904] [2025-03-13 21:57:33,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:33,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 21:57:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 21:57:33,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:33,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135527904] [2025-03-13 21:57:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135527904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084377598] [2025-03-13 21:57:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:33,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:57:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:33,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:57:33,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:57:33,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 278 [2025-03-13 21:57:33,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 218.8) internal successors, (1094), 5 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:33,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:33,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 278 [2025-03-13 21:57:33,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand