./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:23:01,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:23:01,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:23:01,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:23:01,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:23:01,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:23:01,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:23:01,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:23:01,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:23:01,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:23:01,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:23:01,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:23:01,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:23:01,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:23:01,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:01,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:23:01,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:23:01,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:23:01,795 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 [2025-02-06 09:23:02,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:23:02,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:23:02,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:23:02,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:23:02,087 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:23:02,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-02-06 09:23:03,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbb1dcc9/620b10f60c054954a1925df1d19b4fa7/FLAG1bd321185 [2025-02-06 09:23:03,771 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:23:03,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-02-06 09:23:03,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbb1dcc9/620b10f60c054954a1925df1d19b4fa7/FLAG1bd321185 [2025-02-06 09:23:03,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbb1dcc9/620b10f60c054954a1925df1d19b4fa7 [2025-02-06 09:23:03,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:23:03,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:23:03,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:03,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:23:03,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:23:03,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:03" (1/1) ... [2025-02-06 09:23:03,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:03, skipping insertion in model container [2025-02-06 09:23:03,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:03" (1/1) ... [2025-02-06 09:23:03,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:23:04,357 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,358 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,359 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,362 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:04,426 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:23:04,482 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,483 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,483 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,484 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:23:04,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:04,559 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:23:04,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04 WrapperNode [2025-02-06 09:23:04,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:04,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:04,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:23:04,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:23:04,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,629 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-02-06 09:23:04,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:04,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:23:04,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:23:04,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:23:04,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:23:04,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:23:04,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:23:04,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:23:04,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (1/1) ... [2025-02-06 09:23:04,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:04,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:23:04,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:23:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-06 09:23:04,738 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-06 09:23:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:23:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:23:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:23:04,741 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:23:04,878 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:23:04,880 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:23:05,481 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:23:05,482 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:23:05,517 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:23:05,520 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:23:05,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:05 BoogieIcfgContainer [2025-02-06 09:23:05,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:23:05,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:23:05,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:23:05,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:23:05,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:23:03" (1/3) ... [2025-02-06 09:23:05,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca9ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:05, skipping insertion in model container [2025-02-06 09:23:05,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:04" (2/3) ... [2025-02-06 09:23:05,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca9ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:05, skipping insertion in model container [2025-02-06 09:23:05,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:05" (3/3) ... [2025-02-06 09:23:05,531 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-02-06 09:23:05,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:23:05,547 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_23-evilcollapse_rc.i that has 2 procedures, 372 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-02-06 09:23:05,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:23:05,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:23:05,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 447 transitions, 902 flow [2025-02-06 09:23:05,907 INFO L124 PetriNetUnfolderBase]: 10/445 cut-off events. [2025-02-06 09:23:05,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 445 events. 10/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 666 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 372. Up to 2 conditions per place. [2025-02-06 09:23:05,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 447 transitions, 902 flow [2025-02-06 09:23:05,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 445 transitions, 896 flow [2025-02-06 09:23:05,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:23:05,959 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@440cd99e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:23:05,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 09:23:05,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:23:05,987 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-02-06 09:23:05,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:05,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:05,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:05,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1292152077, now seen corresponding path program 1 times [2025-02-06 09:23:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120993289] [2025-02-06 09:23:06,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:23:06,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:23:06,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120993289] [2025-02-06 09:23:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120993289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056352273] [2025-02-06 09:23:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:07,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:07,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-02-06 09:23:07,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 445 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:07,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:07,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-02-06 09:23:07,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:08,274 INFO L124 PetriNetUnfolderBase]: 449/1917 cut-off events. [2025-02-06 09:23:08,275 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:23:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1917 events. 449/1917 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10989 event pairs, 342 based on Foata normal form. 36/1740 useless extension candidates. Maximal degree in co-relation 2472. Up to 862 conditions per place. [2025-02-06 09:23:08,299 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 88 selfloop transitions, 10 changer transitions 2/439 dead transitions. [2025-02-06 09:23:08,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1080 flow [2025-02-06 09:23:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2162 transitions. [2025-02-06 09:23:08,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061148396718867 [2025-02-06 09:23:08,325 INFO L175 Difference]: Start difference. First operand has 442 places, 445 transitions, 896 flow. Second operand 6 states and 2162 transitions. [2025-02-06 09:23:08,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1080 flow [2025-02-06 09:23:08,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:23:08,347 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 898 flow [2025-02-06 09:23:08,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-02-06 09:23:08,355 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-02-06 09:23:08,357 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 898 flow [2025-02-06 09:23:08,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:08,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:08,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:08,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:23:08,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:08,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1451285049, now seen corresponding path program 1 times [2025-02-06 09:23:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255744674] [2025-02-06 09:23:08,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:08,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:23:08,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:23:08,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:08,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255744674] [2025-02-06 09:23:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255744674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:08,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041060534] [2025-02-06 09:23:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:08,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:08,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:08,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:09,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-02-06 09:23:09,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:09,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:09,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-02-06 09:23:09,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:09,818 INFO L124 PetriNetUnfolderBase]: 449/1913 cut-off events. [2025-02-06 09:23:09,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:09,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1913 events. 449/1913 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10900 event pairs, 342 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2663. Up to 862 conditions per place. [2025-02-06 09:23:09,830 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 88 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-02-06 09:23:09,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 435 transitions, 1090 flow [2025-02-06 09:23:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2158 transitions. [2025-02-06 09:23:09,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046234153616704 [2025-02-06 09:23:09,837 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 898 flow. Second operand 6 states and 2158 transitions. [2025-02-06 09:23:09,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 435 transitions, 1090 flow [2025-02-06 09:23:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:09,845 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 894 flow [2025-02-06 09:23:09,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-02-06 09:23:09,847 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-02-06 09:23:09,847 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 894 flow [2025-02-06 09:23:09,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:09,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:09,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:09,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:23:09,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:09,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 556577461, now seen corresponding path program 1 times [2025-02-06 09:23:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849360] [2025-02-06 09:23:09,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:23:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:23:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849360] [2025-02-06 09:23:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823849360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:23:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83213203] [2025-02-06 09:23:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:09,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:09,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:09,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:10,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-02-06 09:23:10,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:10,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:10,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-02-06 09:23:10,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:10,110 INFO L124 PetriNetUnfolderBase]: 29/737 cut-off events. [2025-02-06 09:23:10,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:10,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 737 events. 29/737 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2144 event pairs, 18 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 510. Up to 45 conditions per place. [2025-02-06 09:23:10,115 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-02-06 09:23:10,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 922 flow [2025-02-06 09:23:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-02-06 09:23:10,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-02-06 09:23:10,119 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 894 flow. Second operand 3 states and 1307 transitions. [2025-02-06 09:23:10,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 922 flow [2025-02-06 09:23:10,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 436 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:10,129 INFO L231 Difference]: Finished difference. Result has 437 places, 436 transitions, 886 flow [2025-02-06 09:23:10,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=437, PETRI_TRANSITIONS=436} [2025-02-06 09:23:10,131 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-02-06 09:23:10,132 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 436 transitions, 886 flow [2025-02-06 09:23:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:10,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:10,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:10,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:23:10,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:10,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1525146210, now seen corresponding path program 1 times [2025-02-06 09:23:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890611276] [2025-02-06 09:23:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:10,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 09:23:10,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 09:23:10,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:10,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:10,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890611276] [2025-02-06 09:23:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890611276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:10,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:10,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970614706] [2025-02-06 09:23:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:10,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:10,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:10,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:11,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-02-06 09:23:11,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 436 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:11,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:11,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-02-06 09:23:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:11,577 INFO L124 PetriNetUnfolderBase]: 450/2035 cut-off events. [2025-02-06 09:23:11,578 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:11,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3003 conditions, 2035 events. 450/2035 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11346 event pairs, 342 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 2746. Up to 910 conditions per place. [2025-02-06 09:23:11,594 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-02-06 09:23:11,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 435 transitions, 1084 flow [2025-02-06 09:23:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-02-06 09:23:11,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-02-06 09:23:11,603 INFO L175 Difference]: Start difference. First operand has 437 places, 436 transitions, 886 flow. Second operand 6 states and 2153 transitions. [2025-02-06 09:23:11,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 435 transitions, 1084 flow [2025-02-06 09:23:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 435 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:11,612 INFO L231 Difference]: Finished difference. Result has 440 places, 435 transitions, 892 flow [2025-02-06 09:23:11,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=440, PETRI_TRANSITIONS=435} [2025-02-06 09:23:11,615 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-02-06 09:23:11,615 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 435 transitions, 892 flow [2025-02-06 09:23:11,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:11,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:11,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:11,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:23:11,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:11,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 475602129, now seen corresponding path program 1 times [2025-02-06 09:23:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-02-06 09:23:11,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:23:11,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:23:11,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:11,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346600055] [2025-02-06 09:23:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346600055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:11,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:23:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201922690] [2025-02-06 09:23:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:11,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:11,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-02-06 09:23:11,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 435 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:11,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:11,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-02-06 09:23:11,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:11,872 INFO L124 PetriNetUnfolderBase]: 29/923 cut-off events. [2025-02-06 09:23:11,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:11,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 923 events. 29/923 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2448 event pairs, 18 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 588. Up to 49 conditions per place. [2025-02-06 09:23:11,881 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-02-06 09:23:11,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 436 transitions, 920 flow [2025-02-06 09:23:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-02-06 09:23:11,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-02-06 09:23:11,885 INFO L175 Difference]: Start difference. First operand has 440 places, 435 transitions, 892 flow. Second operand 3 states and 1307 transitions. [2025-02-06 09:23:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 436 transitions, 920 flow [2025-02-06 09:23:11,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 436 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:11,892 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 894 flow [2025-02-06 09:23:11,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2025-02-06 09:23:11,893 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-02-06 09:23:11,893 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 894 flow [2025-02-06 09:23:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:11,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:11,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:11,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:23:11,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:11,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash 637441325, now seen corresponding path program 1 times [2025-02-06 09:23:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:11,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127440898] [2025-02-06 09:23:11,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 09:23:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 09:23:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127440898] [2025-02-06 09:23:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127440898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296424427] [2025-02-06 09:23:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:12,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:12,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:12,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:13,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-02-06 09:23:13,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:13,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:13,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-02-06 09:23:13,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:13,443 INFO L124 PetriNetUnfolderBase]: 75/1235 cut-off events. [2025-02-06 09:23:13,444 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:23:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1235 events. 75/1235 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4478 event pairs, 42 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1032. Up to 267 conditions per place. [2025-02-06 09:23:13,451 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-02-06 09:23:13,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 1018 flow [2025-02-06 09:23:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-02-06 09:23:13,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-02-06 09:23:13,457 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 894 flow. Second operand 6 states and 2338 transitions. [2025-02-06 09:23:13,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 1018 flow [2025-02-06 09:23:13,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 435 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:13,464 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 900 flow [2025-02-06 09:23:13,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-02-06 09:23:13,467 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2025-02-06 09:23:13,467 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 900 flow [2025-02-06 09:23:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:13,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:13,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:23:13,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash -645751327, now seen corresponding path program 1 times [2025-02-06 09:23:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631296824] [2025-02-06 09:23:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:13,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:23:13,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:23:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631296824] [2025-02-06 09:23:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631296824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:14,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235485764] [2025-02-06 09:23:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:14,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:14,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:14,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-02-06 09:23:14,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:14,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:14,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-02-06 09:23:14,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:15,007 INFO L124 PetriNetUnfolderBase]: 450/2215 cut-off events. [2025-02-06 09:23:15,008 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:15,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 2215 events. 450/2215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12049 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2789. Up to 976 conditions per place. [2025-02-06 09:23:15,023 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/434 dead transitions. [2025-02-06 09:23:15,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 434 transitions, 1098 flow [2025-02-06 09:23:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-02-06 09:23:15,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-02-06 09:23:15,028 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 900 flow. Second operand 6 states and 2153 transitions. [2025-02-06 09:23:15,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 434 transitions, 1098 flow [2025-02-06 09:23:15,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 434 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:15,035 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 898 flow [2025-02-06 09:23:15,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-02-06 09:23:15,036 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-02-06 09:23:15,036 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 898 flow [2025-02-06 09:23:15,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:15,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:15,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:15,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:23:15,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1184388287, now seen corresponding path program 1 times [2025-02-06 09:23:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027968447] [2025-02-06 09:23:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:15,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 09:23:15,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 09:23:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027968447] [2025-02-06 09:23:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027968447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:15,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:15,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581466854] [2025-02-06 09:23:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:15,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:15,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:16,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-02-06 09:23:16,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:16,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:16,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-02-06 09:23:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:16,468 INFO L124 PetriNetUnfolderBase]: 450/2211 cut-off events. [2025-02-06 09:23:16,468 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:16,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 2211 events. 450/2211 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12070 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2805. Up to 960 conditions per place. [2025-02-06 09:23:16,485 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-02-06 09:23:16,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 433 transitions, 1088 flow [2025-02-06 09:23:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-02-06 09:23:16,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-02-06 09:23:16,490 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 898 flow. Second operand 6 states and 2173 transitions. [2025-02-06 09:23:16,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 433 transitions, 1088 flow [2025-02-06 09:23:16,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 433 transitions, 1078 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:16,498 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 896 flow [2025-02-06 09:23:16,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-02-06 09:23:16,501 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-02-06 09:23:16,501 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 896 flow [2025-02-06 09:23:16,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:16,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:16,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:23:16,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 157923113, now seen corresponding path program 1 times [2025-02-06 09:23:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443850111] [2025-02-06 09:23:16,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:16,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 09:23:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 09:23:16,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:16,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:23:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443850111] [2025-02-06 09:23:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443850111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104667820] [2025-02-06 09:23:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:17,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:17,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:17,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-02-06 09:23:17,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:17,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:17,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-02-06 09:23:17,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:17,842 INFO L124 PetriNetUnfolderBase]: 450/2207 cut-off events. [2025-02-06 09:23:17,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:17,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 2207 events. 450/2207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12003 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2820. Up to 960 conditions per place. [2025-02-06 09:23:17,860 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/432 dead transitions. [2025-02-06 09:23:17,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 432 transitions, 1086 flow [2025-02-06 09:23:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-02-06 09:23:17,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-02-06 09:23:17,866 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 896 flow. Second operand 6 states and 2173 transitions. [2025-02-06 09:23:17,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 432 transitions, 1086 flow [2025-02-06 09:23:17,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 432 transitions, 1076 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:17,873 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 894 flow [2025-02-06 09:23:17,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-02-06 09:23:17,875 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-02-06 09:23:17,875 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 894 flow [2025-02-06 09:23:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:17,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:17,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:23:17,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:17,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -56164290, now seen corresponding path program 1 times [2025-02-06 09:23:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41884095] [2025-02-06 09:23:17,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 09:23:17,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 09:23:17,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:17,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:23:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41884095] [2025-02-06 09:23:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41884095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745897957] [2025-02-06 09:23:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:18,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:18,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:18,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:18,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-02-06 09:23:18,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:18,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:18,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-02-06 09:23:18,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:19,311 INFO L124 PetriNetUnfolderBase]: 450/2203 cut-off events. [2025-02-06 09:23:19,312 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:19,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2203 events. 450/2203 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12031 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2833. Up to 980 conditions per place. [2025-02-06 09:23:19,324 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/431 dead transitions. [2025-02-06 09:23:19,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 431 transitions, 1094 flow [2025-02-06 09:23:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-02-06 09:23:19,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-02-06 09:23:19,330 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 894 flow. Second operand 6 states and 2148 transitions. [2025-02-06 09:23:19,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 431 transitions, 1094 flow [2025-02-06 09:23:19,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:19,338 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 892 flow [2025-02-06 09:23:19,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-02-06 09:23:19,340 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-02-06 09:23:19,340 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 892 flow [2025-02-06 09:23:19,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:19,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:19,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:23:19,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:19,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -273165573, now seen corresponding path program 1 times [2025-02-06 09:23:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:19,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040124621] [2025-02-06 09:23:19,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:19,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 09:23:19,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 09:23:19,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:19,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040124621] [2025-02-06 09:23:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040124621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59064702] [2025-02-06 09:23:19,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:19,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:19,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:23:19,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 09:23:19,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 09:23:19,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:19,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:19,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:23:19,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:19,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59064702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:20,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:20,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:23:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930658027] [2025-02-06 09:23:20,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:20,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:23:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:20,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:23:20,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:23:20,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-02-06 09:23:20,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 892 flow. Second operand has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:20,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:20,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-02-06 09:23:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:20,395 INFO L124 PetriNetUnfolderBase]: 29/1087 cut-off events. [2025-02-06 09:23:20,396 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:23:20,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1087 events. 29/1087 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1988 event pairs, 18 based on Foata normal form. 4/1049 useless extension candidates. Maximal degree in co-relation 581. Up to 49 conditions per place. [2025-02-06 09:23:20,400 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 15 selfloop transitions, 9 changer transitions 0/439 dead transitions. [2025-02-06 09:23:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 958 flow [2025-02-06 09:23:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:23:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:23:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3878 transitions. [2025-02-06 09:23:20,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639572458364405 [2025-02-06 09:23:20,407 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 892 flow. Second operand 9 states and 3878 transitions. [2025-02-06 09:23:20,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 958 flow [2025-02-06 09:23:20,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:20,413 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 932 flow [2025-02-06 09:23:20,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=932, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-02-06 09:23:20,414 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-02-06 09:23:20,415 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 932 flow [2025-02-06 09:23:20,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:20,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:20,417 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:20,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:23:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 09:23:20,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1694650929, now seen corresponding path program 2 times [2025-02-06 09:23:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144533409] [2025-02-06 09:23:20,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:20,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-02-06 09:23:20,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 403 statements. [2025-02-06 09:23:20,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:20,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-02-06 09:23:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144533409] [2025-02-06 09:23:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144533409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071372072] [2025-02-06 09:23:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:20,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:20,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:22,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 447 [2025-02-06 09:23:22,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:22,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:22,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 447 [2025-02-06 09:23:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:22,401 INFO L124 PetriNetUnfolderBase]: 75/1401 cut-off events. [2025-02-06 09:23:22,402 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:23:22,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1401 events. 75/1401 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4018 event pairs, 42 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 1161. Up to 314 conditions per place. [2025-02-06 09:23:22,410 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 61 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-02-06 09:23:22,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 435 transitions, 1070 flow [2025-02-06 09:23:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-02-06 09:23:22,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854958985831469 [2025-02-06 09:23:22,415 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 932 flow. Second operand 6 states and 2293 transitions. [2025-02-06 09:23:22,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 435 transitions, 1070 flow [2025-02-06 09:23:22,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 435 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:22,423 INFO L231 Difference]: Finished difference. Result has 445 places, 435 transitions, 942 flow [2025-02-06 09:23:22,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=445, PETRI_TRANSITIONS=435} [2025-02-06 09:23:22,426 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2025-02-06 09:23:22,426 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 435 transitions, 942 flow [2025-02-06 09:23:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:22,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:22,428 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:23:22,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1531654921, now seen corresponding path program 1 times [2025-02-06 09:23:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:22,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491074710] [2025-02-06 09:23:22,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:22,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-06 09:23:22,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-06 09:23:22,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:22,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-02-06 09:23:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491074710] [2025-02-06 09:23:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491074710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681940004] [2025-02-06 09:23:22,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:22,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:22,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:22,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:23:23,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-06 09:23:23,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-06 09:23:23,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:23,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:23:23,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 09:23:23,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 09:23:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681940004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:24,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 09:23:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878432345] [2025-02-06 09:23:24,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 09:23:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:24,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 09:23:24,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 09:23:24,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 447 [2025-02-06 09:23:24,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 435 transitions, 942 flow. Second operand has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 447 [2025-02-06 09:23:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:25,489 INFO L124 PetriNetUnfolderBase]: 30/2465 cut-off events. [2025-02-06 09:23:25,490 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-06 09:23:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2465 events. 30/2465 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1975 event pairs, 18 based on Foata normal form. 13/2438 useless extension candidates. Maximal degree in co-relation 2329. Up to 51 conditions per place. [2025-02-06 09:23:25,496 INFO L140 encePairwiseOnDemand]: 436/447 looper letters, 47 selfloop transitions, 68 changer transitions 0/521 dead transitions. [2025-02-06 09:23:25,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 521 transitions, 1582 flow [2025-02-06 09:23:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 09:23:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-02-06 09:23:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 26714 transitions. [2025-02-06 09:23:25,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486168815027876 [2025-02-06 09:23:25,523 INFO L175 Difference]: Start difference. First operand has 445 places, 435 transitions, 942 flow. Second operand 63 states and 26714 transitions. [2025-02-06 09:23:25,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 521 transitions, 1582 flow [2025-02-06 09:23:25,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 521 transitions, 1562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:25,531 INFO L231 Difference]: Finished difference. Result has 518 places, 497 transitions, 1442 flow [2025-02-06 09:23:25,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1442, PETRI_PLACES=518, PETRI_TRANSITIONS=497} [2025-02-06 09:23:25,532 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 76 predicate places. [2025-02-06 09:23:25,532 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 497 transitions, 1442 flow [2025-02-06 09:23:25,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:25,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:25,536 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:25,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:23:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:25,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:25,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1056443811, now seen corresponding path program 2 times [2025-02-06 09:23:25,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:25,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520238670] [2025-02-06 09:23:25,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:25,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1465 statements into 2 equivalence classes. [2025-02-06 09:23:25,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 147 of 1465 statements. [2025-02-06 09:23:25,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:25,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-02-06 09:23:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520238670] [2025-02-06 09:23:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520238670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:26,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:26,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653647306] [2025-02-06 09:23:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:26,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:26,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:26,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:26,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-02-06 09:23:26,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 497 transitions, 1442 flow. Second operand has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:26,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:26,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-02-06 09:23:26,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:27,818 INFO L124 PetriNetUnfolderBase]: 188/3246 cut-off events. [2025-02-06 09:23:27,818 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-02-06 09:23:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 3246 events. 188/3246 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8048 event pairs, 126 based on Foata normal form. 0/3087 useless extension candidates. Maximal degree in co-relation 2458. Up to 899 conditions per place. [2025-02-06 09:23:27,830 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/496 dead transitions. [2025-02-06 09:23:27,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 496 transitions, 1566 flow [2025-02-06 09:23:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-02-06 09:23:27,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-02-06 09:23:27,834 INFO L175 Difference]: Start difference. First operand has 518 places, 497 transitions, 1442 flow. Second operand 6 states and 2338 transitions. [2025-02-06 09:23:27,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 496 transitions, 1566 flow [2025-02-06 09:23:27,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 496 transitions, 1490 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-02-06 09:23:27,846 INFO L231 Difference]: Finished difference. Result has 515 places, 496 transitions, 1374 flow [2025-02-06 09:23:27,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1374, PETRI_PLACES=515, PETRI_TRANSITIONS=496} [2025-02-06 09:23:27,847 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 73 predicate places. [2025-02-06 09:23:27,847 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1374 flow [2025-02-06 09:23:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:27,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:27,848 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:27,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:23:27,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash 277532280, now seen corresponding path program 1 times [2025-02-06 09:23:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432669454] [2025-02-06 09:23:27,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:28,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-02-06 09:23:28,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-02-06 09:23:28,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:28,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432669454] [2025-02-06 09:23:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432669454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250441902] [2025-02-06 09:23:31,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:31,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:31,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:31,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:23:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-02-06 09:23:32,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-02-06 09:23:32,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:32,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:32,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 5753 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:23:32,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:33,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250441902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:33,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-06 09:23:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021415827] [2025-02-06 09:23:33,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 09:23:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 09:23:33,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 09:23:33,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-02-06 09:23:34,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 496 transitions, 1374 flow. Second operand has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:34,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:34,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-02-06 09:23:34,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:36,205 INFO L124 PetriNetUnfolderBase]: 30/4624 cut-off events. [2025-02-06 09:23:36,205 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-02-06 09:23:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 4624 events. 30/4624 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1976 event pairs, 18 based on Foata normal form. 24/4609 useless extension candidates. Maximal degree in co-relation 5016. Up to 78 conditions per place. [2025-02-06 09:23:36,217 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 47 selfloop transitions, 135 changer transitions 0/597 dead transitions. [2025-02-06 09:23:36,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 597 transitions, 2502 flow [2025-02-06 09:23:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 09:23:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-02-06 09:23:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19340 transitions. [2025-02-06 09:23:36,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614715386527467 [2025-02-06 09:23:36,231 INFO L175 Difference]: Start difference. First operand has 515 places, 496 transitions, 1374 flow. Second operand 45 states and 19340 transitions. [2025-02-06 09:23:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 597 transitions, 2502 flow [2025-02-06 09:23:36,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 597 transitions, 2492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:36,250 INFO L231 Difference]: Finished difference. Result has 563 places, 571 transitions, 2238 flow [2025-02-06 09:23:36,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2238, PETRI_PLACES=563, PETRI_TRANSITIONS=571} [2025-02-06 09:23:36,252 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 121 predicate places. [2025-02-06 09:23:36,252 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 571 transitions, 2238 flow [2025-02-06 09:23:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:36,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:36,259 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:36,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:23:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:36,459 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -255393672, now seen corresponding path program 2 times [2025-02-06 09:23:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747985100] [2025-02-06 09:23:36,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:36,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2912 statements into 2 equivalence classes. [2025-02-06 09:23:36,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 2912 statements. [2025-02-06 09:23:36,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-02-06 09:23:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747985100] [2025-02-06 09:23:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747985100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273941294] [2025-02-06 09:23:37,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:37,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:37,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:37,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:37,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:37,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-02-06 09:23:37,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 571 transitions, 2238 flow. Second operand has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:37,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:37,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-02-06 09:23:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:41,971 INFO L124 PetriNetUnfolderBase]: 1238/7754 cut-off events. [2025-02-06 09:23:41,971 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-02-06 09:23:41,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 7754 events. 1238/7754 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 28126 event pairs, 1026 based on Foata normal form. 0/7369 useless extension candidates. Maximal degree in co-relation 7662. Up to 3430 conditions per place. [2025-02-06 09:23:41,998 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/570 dead transitions. [2025-02-06 09:23:41,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 570 transitions, 2438 flow [2025-02-06 09:23:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-02-06 09:23:42,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-02-06 09:23:42,001 INFO L175 Difference]: Start difference. First operand has 563 places, 571 transitions, 2238 flow. Second operand 6 states and 2148 transitions. [2025-02-06 09:23:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 570 transitions, 2438 flow [2025-02-06 09:23:42,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 570 transitions, 2330 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-02-06 09:23:42,085 INFO L231 Difference]: Finished difference. Result has 549 places, 570 transitions, 2138 flow [2025-02-06 09:23:42,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2138, PETRI_PLACES=549, PETRI_TRANSITIONS=570} [2025-02-06 09:23:42,087 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 107 predicate places. [2025-02-06 09:23:42,087 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 570 transitions, 2138 flow [2025-02-06 09:23:42,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:42,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:42,089 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:23:42,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:23:42,089 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:23:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1030857171, now seen corresponding path program 1 times [2025-02-06 09:23:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754488684] [2025-02-06 09:23:42,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:42,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-02-06 09:23:42,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-02-06 09:23:42,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:42,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-02-06 09:23:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754488684] [2025-02-06 09:23:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754488684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404397615] [2025-02-06 09:23:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:54,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:54,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:54,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:54,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:23:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-02-06 09:23:56,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-02-06 09:23:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:56,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 11716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 09:23:57,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-02-06 09:23:58,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:24:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-02-06 09:24:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404397615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:24:00,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:24:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-02-06 09:24:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690021057] [2025-02-06 09:24:00,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:24:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 09:24:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:00,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 09:24:00,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 09:24:00,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-02-06 09:24:00,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 570 transitions, 2138 flow. Second operand has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:00,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:00,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-02-06 09:24:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:06,750 INFO L124 PetriNetUnfolderBase]: 30/8673 cut-off events. [2025-02-06 09:24:06,750 INFO L125 PetriNetUnfolderBase]: For 13371/13371 co-relation queries the response was YES. [2025-02-06 09:24:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10603 conditions, 8673 events. 30/8673 cut-off events. For 13371/13371 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1964 event pairs, 18 based on Foata normal form. 45/8680 useless extension candidates. Maximal degree in co-relation 10183. Up to 168 conditions per place. [2025-02-06 09:24:06,767 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 92 selfloop transitions, 270 changer transitions 0/776 dead transitions. [2025-02-06 09:24:06,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 776 transitions, 5048 flow [2025-02-06 09:24:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-02-06 09:24:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-02-06 09:24:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 38667 transitions. [2025-02-06 09:24:06,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611483967188665 [2025-02-06 09:24:06,794 INFO L175 Difference]: Start difference. First operand has 549 places, 570 transitions, 2138 flow. Second operand 90 states and 38667 transitions. [2025-02-06 09:24:06,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 776 transitions, 5048 flow [2025-02-06 09:24:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 776 transitions, 5038 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:24:06,829 INFO L231 Difference]: Finished difference. Result has 649 places, 708 transitions, 4120 flow [2025-02-06 09:24:06,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4120, PETRI_PLACES=649, PETRI_TRANSITIONS=708} [2025-02-06 09:24:06,831 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 207 predicate places. [2025-02-06 09:24:06,831 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 708 transitions, 4120 flow [2025-02-06 09:24:06,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:06,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:06,841 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:24:06,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 09:24:07,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 09:24:07,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:24:07,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1092205587, now seen corresponding path program 2 times [2025-02-06 09:24:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115920160] [2025-02-06 09:24:07,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:24:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:07,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5641 statements into 2 equivalence classes. [2025-02-06 09:24:07,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 5641 statements. [2025-02-06 09:24:07,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:24:07,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 290132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290132 trivial. 0 not checked. [2025-02-06 09:24:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:08,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115920160] [2025-02-06 09:24:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115920160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:08,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737779291] [2025-02-06 09:24:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:08,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:09,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 447 [2025-02-06 09:24:09,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 708 transitions, 4120 flow. Second operand has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:09,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:09,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 447 [2025-02-06 09:24:09,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:16,402 INFO L124 PetriNetUnfolderBase]: 200/9574 cut-off events. [2025-02-06 09:24:16,403 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-02-06 09:24:16,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14432 conditions, 9574 events. 200/9574 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8952 event pairs, 54 based on Foata normal form. 0/9432 useless extension candidates. Maximal degree in co-relation 8410. Up to 2812 conditions per place. [2025-02-06 09:24:16,427 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 75 selfloop transitions, 23 changer transitions 0/743 dead transitions. [2025-02-06 09:24:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 743 transitions, 4394 flow [2025-02-06 09:24:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2379 transitions. [2025-02-06 09:24:16,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870246085011185 [2025-02-06 09:24:16,431 INFO L175 Difference]: Start difference. First operand has 649 places, 708 transitions, 4120 flow. Second operand 6 states and 2379 transitions. [2025-02-06 09:24:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 743 transitions, 4394 flow [2025-02-06 09:24:16,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 743 transitions, 4040 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-02-06 09:24:16,481 INFO L231 Difference]: Finished difference. Result has 617 places, 730 transitions, 3924 flow [2025-02-06 09:24:16,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3924, PETRI_PLACES=617, PETRI_TRANSITIONS=730} [2025-02-06 09:24:16,482 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 175 predicate places. [2025-02-06 09:24:16,482 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 730 transitions, 3924 flow [2025-02-06 09:24:16,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:16,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:16,485 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:24:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:24:16,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:24:16,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 975219702, now seen corresponding path program 1 times [2025-02-06 09:24:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14402328] [2025-02-06 09:24:16,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:17,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-02-06 09:24:17,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-02-06 09:24:17,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:17,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat