./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -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 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:49,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:49,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:33:49,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:49,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:49,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:49,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:49,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:49,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:49,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:49,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:49,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:49,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:49,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:49,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:49,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:49,591 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 -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2025-01-09 21:33:49,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:49,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:49,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:49,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:49,764 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:49,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-01-09 21:33:50,965 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb15cf33/6bbca7eb469d41f6b512caf0f8b96c13/FLAG2f25196a2 [2025-01-09 21:33:51,220 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:51,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-01-09 21:33:51,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb15cf33/6bbca7eb469d41f6b512caf0f8b96c13/FLAG2f25196a2 [2025-01-09 21:33:51,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb15cf33/6bbca7eb469d41f6b512caf0f8b96c13 [2025-01-09 21:33:51,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:51,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:51,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:51,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:51,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:51,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d503739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51, skipping insertion in model container [2025-01-09 21:33:51,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:51,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:51,729 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:51,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:51,772 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:51,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51 WrapperNode [2025-01-09 21:33:51,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:51,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:51,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:51,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:51,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,811 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 451 [2025-01-09 21:33:51,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:51,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:51,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:51,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:51,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:51,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:51,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:51,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:51,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (1/1) ... [2025-01-09 21:33:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:51,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:33:51,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:51,892 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:51,892 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:51,892 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:33:51,892 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:33:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:51,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:51,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:51,894 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:33:52,060 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:52,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:52,544 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:52,544 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:52,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:52,861 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:33:52,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:52 BoogieIcfgContainer [2025-01-09 21:33:52,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:52,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:52,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:52,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:52,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:51" (1/3) ... [2025-01-09 21:33:52,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8eb21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:52, skipping insertion in model container [2025-01-09 21:33:52,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:51" (2/3) ... [2025-01-09 21:33:52,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8eb21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:52, skipping insertion in model container [2025-01-09 21:33:52,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:52" (3/3) ... [2025-01-09 21:33:52,868 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2025-01-09 21:33:52,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:52,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons3.wvr.c that has 5 procedures, 357 locations, 1 initial locations, 5 loop locations, and 68 error locations. [2025-01-09 21:33:52,880 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:52,953 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:33:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 369 transitions, 766 flow [2025-01-09 21:33:53,074 INFO L124 PetriNetUnfolderBase]: 13/365 cut-off events. [2025-01-09 21:33:53,076 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:53,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 365 events. 13/365 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 505 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 338. Up to 2 conditions per place. [2025-01-09 21:33:53,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 369 transitions, 766 flow [2025-01-09 21:33:53,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 348 transitions, 720 flow [2025-01-09 21:33:53,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:53,126 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;@1484113c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:53,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 121 error locations. [2025-01-09 21:33:53,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:53,136 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-01-09 21:33:53,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:53,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:53,136 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] [2025-01-09 21:33:53,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:53,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1124686368, now seen corresponding path program 1 times [2025-01-09 21:33:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853405813] [2025-01-09 21:33:53,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:53,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:33:53,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:33:53,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:53,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853405813] [2025-01-09 21:33:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853405813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447766716] [2025-01-09 21:33:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:53,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:53,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:53,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:53,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 369 [2025-01-09 21:33:53,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 348 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:53,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:53,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 369 [2025-01-09 21:33:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:53,748 INFO L124 PetriNetUnfolderBase]: 752/1727 cut-off events. [2025-01-09 21:33:53,749 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-01-09 21:33:53,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1727 events. 752/1727 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9825 event pairs, 600 based on Foata normal form. 6/1582 useless extension candidates. Maximal degree in co-relation 2698. Up to 1053 conditions per place. [2025-01-09 21:33:53,764 INFO L140 encePairwiseOnDemand]: 312/369 looper letters, 26 selfloop transitions, 2 changer transitions 6/293 dead transitions. [2025-01-09 21:33:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 666 flow [2025-01-09 21:33:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-01-09 21:33:53,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419150858175248 [2025-01-09 21:33:53,777 INFO L175 Difference]: Start difference. First operand has 349 places, 348 transitions, 720 flow. Second operand 3 states and 932 transitions. [2025-01-09 21:33:53,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 293 transitions, 666 flow [2025-01-09 21:33:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 293 transitions, 650 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:53,786 INFO L231 Difference]: Finished difference. Result has 294 places, 287 transitions, 586 flow [2025-01-09 21:33:53,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=294, PETRI_TRANSITIONS=287} [2025-01-09 21:33:53,791 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -55 predicate places. [2025-01-09 21:33:53,791 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 287 transitions, 586 flow [2025-01-09 21:33:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:53,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:53,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:53,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1975939438, now seen corresponding path program 1 times [2025-01-09 21:33:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531917774] [2025-01-09 21:33:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:33:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:33:53,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531917774] [2025-01-09 21:33:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531917774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:53,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:53,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795242558] [2025-01-09 21:33:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:53,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:53,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:53,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 369 [2025-01-09 21:33:53,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 287 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:53,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:53,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 369 [2025-01-09 21:33:53,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,180 INFO L124 PetriNetUnfolderBase]: 923/1998 cut-off events. [2025-01-09 21:33:54,180 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:54,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 1998 events. 923/1998 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11751 event pairs, 743 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 3385. Up to 1288 conditions per place. [2025-01-09 21:33:54,191 INFO L140 encePairwiseOnDemand]: 365/369 looper letters, 26 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-01-09 21:33:54,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 284 transitions, 634 flow [2025-01-09 21:33:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-01-09 21:33:54,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7940379403794038 [2025-01-09 21:33:54,193 INFO L175 Difference]: Start difference. First operand has 294 places, 287 transitions, 586 flow. Second operand 3 states and 879 transitions. [2025-01-09 21:33:54,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 284 transitions, 634 flow [2025-01-09 21:33:54,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,197 INFO L231 Difference]: Finished difference. Result has 285 places, 284 transitions, 578 flow [2025-01-09 21:33:54,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=284} [2025-01-09 21:33:54,198 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2025-01-09 21:33:54,198 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 284 transitions, 578 flow [2025-01-09 21:33:54,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:54,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1585945533, now seen corresponding path program 1 times [2025-01-09 21:33:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611792003] [2025-01-09 21:33:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:33:54,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:33:54,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611792003] [2025-01-09 21:33:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611792003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021843087] [2025-01-09 21:33:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-01-09 21:33:54,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-01-09 21:33:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,505 INFO L124 PetriNetUnfolderBase]: 565/1385 cut-off events. [2025-01-09 21:33:54,506 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:54,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1385 events. 565/1385 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7525 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2025-01-09 21:33:54,515 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-01-09 21:33:54,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 283 transitions, 628 flow [2025-01-09 21:33:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-01-09 21:33:54,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-01-09 21:33:54,517 INFO L175 Difference]: Start difference. First operand has 285 places, 284 transitions, 578 flow. Second operand 3 states and 882 transitions. [2025-01-09 21:33:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 283 transitions, 628 flow [2025-01-09 21:33:54,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 283 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:54,521 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 579 flow [2025-01-09 21:33:54,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2025-01-09 21:33:54,522 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2025-01-09 21:33:54,522 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 579 flow [2025-01-09 21:33:54,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,523 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] [2025-01-09 21:33:54,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:54,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1631765224, now seen corresponding path program 1 times [2025-01-09 21:33:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852784209] [2025-01-09 21:33:54,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:33:54,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:33:54,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852784209] [2025-01-09 21:33:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852784209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961740512] [2025-01-09 21:33:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-01-09 21:33:54,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-01-09 21:33:54,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,865 INFO L124 PetriNetUnfolderBase]: 565/1384 cut-off events. [2025-01-09 21:33:54,865 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:54,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1384 events. 565/1384 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7541 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2247. Up to 815 conditions per place. [2025-01-09 21:33:54,871 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-01-09 21:33:54,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 282 transitions, 629 flow [2025-01-09 21:33:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-01-09 21:33:54,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-01-09 21:33:54,873 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 579 flow. Second operand 3 states and 882 transitions. [2025-01-09 21:33:54,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 282 transitions, 629 flow [2025-01-09 21:33:54,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,876 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 577 flow [2025-01-09 21:33:54,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2025-01-09 21:33:54,878 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -65 predicate places. [2025-01-09 21:33:54,878 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 577 flow [2025-01-09 21:33:54,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,878 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] [2025-01-09 21:33:54,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:54,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:54,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2046928377, now seen corresponding path program 1 times [2025-01-09 21:33:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342603970] [2025-01-09 21:33:54,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:33:54,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:33:54,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342603970] [2025-01-09 21:33:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342603970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121496126] [2025-01-09 21:33:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-01-09 21:33:54,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-01-09 21:33:54,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,078 INFO L124 PetriNetUnfolderBase]: 565/1383 cut-off events. [2025-01-09 21:33:55,078 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:55,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1383 events. 565/1383 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7541 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2025-01-09 21:33:55,084 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:33:55,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 281 transitions, 627 flow [2025-01-09 21:33:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-01-09 21:33:55,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-01-09 21:33:55,087 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 577 flow. Second operand 3 states and 882 transitions. [2025-01-09 21:33:55,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 281 transitions, 627 flow [2025-01-09 21:33:55,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,090 INFO L231 Difference]: Finished difference. Result has 283 places, 281 transitions, 575 flow [2025-01-09 21:33:55,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=283, PETRI_TRANSITIONS=281} [2025-01-09 21:33:55,090 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -66 predicate places. [2025-01-09 21:33:55,090 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 281 transitions, 575 flow [2025-01-09 21:33:55,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,091 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] [2025-01-09 21:33:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:55,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1025130335, now seen corresponding path program 1 times [2025-01-09 21:33:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165377392] [2025-01-09 21:33:55,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:33:55,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:33:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165377392] [2025-01-09 21:33:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165377392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342185282] [2025-01-09 21:33:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-01-09 21:33:55,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 281 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-01-09 21:33:55,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,273 INFO L124 PetriNetUnfolderBase]: 565/1382 cut-off events. [2025-01-09 21:33:55,273 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:33:55,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1382 events. 565/1382 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7541 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2245. Up to 815 conditions per place. [2025-01-09 21:33:55,279 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:33:55,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 280 transitions, 625 flow [2025-01-09 21:33:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-01-09 21:33:55,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-01-09 21:33:55,282 INFO L175 Difference]: Start difference. First operand has 283 places, 281 transitions, 575 flow. Second operand 3 states and 882 transitions. [2025-01-09 21:33:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 280 transitions, 625 flow [2025-01-09 21:33:55,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 280 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,285 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 573 flow [2025-01-09 21:33:55,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2025-01-09 21:33:55,286 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-01-09 21:33:55,286 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 573 flow [2025-01-09 21:33:55,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:55,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:55,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:55,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1613413578, now seen corresponding path program 1 times [2025-01-09 21:33:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102583660] [2025-01-09 21:33:55,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:33:55,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:33:55,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102583660] [2025-01-09 21:33:55,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102583660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081250443] [2025-01-09 21:33:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-01-09 21:33:55,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-01-09 21:33:55,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,506 INFO L124 PetriNetUnfolderBase]: 687/1772 cut-off events. [2025-01-09 21:33:55,506 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-09 21:33:55,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1772 events. 687/1772 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11031 event pairs, 280 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 2828. Up to 697 conditions per place. [2025-01-09 21:33:55,516 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 35 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:33:55,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 679 flow [2025-01-09 21:33:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:33:55,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175248419150858 [2025-01-09 21:33:55,518 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 573 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:33:55,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 679 flow [2025-01-09 21:33:55,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,523 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 577 flow [2025-01-09 21:33:55,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2025-01-09 21:33:55,524 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-01-09 21:33:55,524 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 577 flow [2025-01-09 21:33:55,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,525 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] [2025-01-09 21:33:55,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:55,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:55,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1657177114, now seen corresponding path program 1 times [2025-01-09 21:33:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320715337] [2025-01-09 21:33:55,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:33:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:33:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320715337] [2025-01-09 21:33:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320715337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709958473] [2025-01-09 21:33:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-01-09 21:33:55,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-01-09 21:33:55,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,972 INFO L124 PetriNetUnfolderBase]: 687/1688 cut-off events. [2025-01-09 21:33:55,972 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-01-09 21:33:55,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1688 events. 687/1688 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10075 event pairs, 566 based on Foata normal form. 0/1573 useless extension candidates. Maximal degree in co-relation 2885. Up to 994 conditions per place. [2025-01-09 21:33:55,980 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-01-09 21:33:55,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 279 transitions, 627 flow [2025-01-09 21:33:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-01-09 21:33:55,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-01-09 21:33:55,982 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 577 flow. Second operand 3 states and 884 transitions. [2025-01-09 21:33:55,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 279 transitions, 627 flow [2025-01-09 21:33:55,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:55,986 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 577 flow [2025-01-09 21:33:55,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2025-01-09 21:33:55,986 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-01-09 21:33:55,986 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 577 flow [2025-01-09 21:33:55,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,987 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] [2025-01-09 21:33:55,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:55,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1684464226, now seen corresponding path program 1 times [2025-01-09 21:33:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332451145] [2025-01-09 21:33:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:33:55,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:33:55,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332451145] [2025-01-09 21:33:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332451145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814974228] [2025-01-09 21:33:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:56,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:56,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-01-09 21:33:56,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:56,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-01-09 21:33:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:56,255 INFO L124 PetriNetUnfolderBase]: 851/2155 cut-off events. [2025-01-09 21:33:56,255 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-09 21:33:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 2155 events. 851/2155 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14588 event pairs, 264 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 3586. Up to 776 conditions per place. [2025-01-09 21:33:56,265 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 37 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:33:56,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 692 flow [2025-01-09 21:33:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:33:56,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175248419150858 [2025-01-09 21:33:56,267 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 577 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:33:56,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 692 flow [2025-01-09 21:33:56,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:56,271 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 581 flow [2025-01-09 21:33:56,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2025-01-09 21:33:56,273 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-01-09 21:33:56,273 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 581 flow [2025-01-09 21:33:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,273 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] [2025-01-09 21:33:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:56,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:56,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -893293604, now seen corresponding path program 1 times [2025-01-09 21:33:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690112256] [2025-01-09 21:33:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:33:56,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:33:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690112256] [2025-01-09 21:33:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690112256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350364032] [2025-01-09 21:33:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:56,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:56,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-01-09 21:33:56,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:56,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-01-09 21:33:56,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:56,595 INFO L124 PetriNetUnfolderBase]: 851/2198 cut-off events. [2025-01-09 21:33:56,595 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2025-01-09 21:33:56,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 2198 events. 851/2198 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15165 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3839. Up to 1234 conditions per place. [2025-01-09 21:33:56,607 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-01-09 21:33:56,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 633 flow [2025-01-09 21:33:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-01-09 21:33:56,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-01-09 21:33:56,610 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 581 flow. Second operand 3 states and 884 transitions. [2025-01-09 21:33:56,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 633 flow [2025-01-09 21:33:56,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 278 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:56,615 INFO L231 Difference]: Finished difference. Result has 282 places, 278 transitions, 581 flow [2025-01-09 21:33:56,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=282, PETRI_TRANSITIONS=278} [2025-01-09 21:33:56,616 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-01-09 21:33:56,617 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 278 transitions, 581 flow [2025-01-09 21:33:56,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,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] [2025-01-09 21:33:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:56,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:56,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 582203972, now seen corresponding path program 1 times [2025-01-09 21:33:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446086962] [2025-01-09 21:33:56,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:33:56,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:33:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446086962] [2025-01-09 21:33:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446086962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351530319] [2025-01-09 21:33:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:56,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-01-09 21:33:56,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 278 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:56,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-01-09 21:33:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:56,929 INFO L124 PetriNetUnfolderBase]: 851/2197 cut-off events. [2025-01-09 21:33:56,929 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:56,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 2197 events. 851/2197 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15181 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3774. Up to 1238 conditions per place. [2025-01-09 21:33:56,940 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 26 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-01-09 21:33:56,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 277 transitions, 635 flow [2025-01-09 21:33:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-01-09 21:33:56,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-01-09 21:33:56,942 INFO L175 Difference]: Start difference. First operand has 282 places, 278 transitions, 581 flow. Second operand 3 states and 882 transitions. [2025-01-09 21:33:56,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 277 transitions, 635 flow [2025-01-09 21:33:56,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 277 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:56,946 INFO L231 Difference]: Finished difference. Result has 281 places, 277 transitions, 579 flow [2025-01-09 21:33:56,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=281, PETRI_TRANSITIONS=277} [2025-01-09 21:33:56,948 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -68 predicate places. [2025-01-09 21:33:56,948 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 277 transitions, 579 flow [2025-01-09 21:33:56,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:56,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,948 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] [2025-01-09 21:33:56,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:56,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1362009300, now seen corresponding path program 1 times [2025-01-09 21:33:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298102066] [2025-01-09 21:33:56,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:33:56,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:33:56,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298102066] [2025-01-09 21:33:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298102066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059249563] [2025-01-09 21:33:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:56,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:57,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-01-09 21:33:57,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 277 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-01-09 21:33:57,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:57,202 INFO L124 PetriNetUnfolderBase]: 851/2196 cut-off events. [2025-01-09 21:33:57,203 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:57,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2196 events. 851/2196 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15169 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3768. Up to 1232 conditions per place. [2025-01-09 21:33:57,216 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2025-01-09 21:33:57,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 627 flow [2025-01-09 21:33:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-01-09 21:33:57,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-01-09 21:33:57,218 INFO L175 Difference]: Start difference. First operand has 281 places, 277 transitions, 579 flow. Second operand 3 states and 891 transitions. [2025-01-09 21:33:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 627 flow [2025-01-09 21:33:57,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:57,222 INFO L231 Difference]: Finished difference. Result has 280 places, 276 transitions, 575 flow [2025-01-09 21:33:57,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=280, PETRI_TRANSITIONS=276} [2025-01-09 21:33:57,223 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -69 predicate places. [2025-01-09 21:33:57,223 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 276 transitions, 575 flow [2025-01-09 21:33:57,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:57,225 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] [2025-01-09 21:33:57,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:57,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1769910629, now seen corresponding path program 1 times [2025-01-09 21:33:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:57,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968248599] [2025-01-09 21:33:57,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:57,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:33:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:33:57,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:57,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968248599] [2025-01-09 21:33:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968248599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849624545] [2025-01-09 21:33:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:57,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:57,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:57,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-01-09 21:33:57,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 276 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-01-09 21:33:57,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:57,536 INFO L124 PetriNetUnfolderBase]: 851/2195 cut-off events. [2025-01-09 21:33:57,536 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:57,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2195 events. 851/2195 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15165 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3767. Up to 1234 conditions per place. [2025-01-09 21:33:57,543 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-01-09 21:33:57,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 275 transitions, 627 flow [2025-01-09 21:33:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-01-09 21:33:57,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-01-09 21:33:57,545 INFO L175 Difference]: Start difference. First operand has 280 places, 276 transitions, 575 flow. Second operand 3 states and 884 transitions. [2025-01-09 21:33:57,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 275 transitions, 627 flow [2025-01-09 21:33:57,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 275 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:57,548 INFO L231 Difference]: Finished difference. Result has 280 places, 275 transitions, 576 flow [2025-01-09 21:33:57,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=275} [2025-01-09 21:33:57,549 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -69 predicate places. [2025-01-09 21:33:57,549 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 275 transitions, 576 flow [2025-01-09 21:33:57,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:57,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:57,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:57,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:57,550 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1340417991, now seen corresponding path program 1 times [2025-01-09 21:33:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699474103] [2025-01-09 21:33:57,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:57,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:33:57,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:33:57,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:57,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699474103] [2025-01-09 21:33:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699474103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115275083] [2025-01-09 21:33:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:58,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 369 [2025-01-09 21:33:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 275 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 369 [2025-01-09 21:33:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,805 INFO L124 PetriNetUnfolderBase]: 851/2193 cut-off events. [2025-01-09 21:33:58,808 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:58,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 2193 events. 851/2193 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15138 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3789. Up to 1247 conditions per place. [2025-01-09 21:33:58,826 INFO L140 encePairwiseOnDemand]: 357/369 looper letters, 38 selfloop transitions, 10 changer transitions 0/273 dead transitions. [2025-01-09 21:33:58,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 273 transitions, 668 flow [2025-01-09 21:33:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1638 transitions. [2025-01-09 21:33:58,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7398373983739838 [2025-01-09 21:33:58,832 INFO L175 Difference]: Start difference. First operand has 280 places, 275 transitions, 576 flow. Second operand 6 states and 1638 transitions. [2025-01-09 21:33:58,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 273 transitions, 668 flow [2025-01-09 21:33:58,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 273 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:58,839 INFO L231 Difference]: Finished difference. Result has 281 places, 273 transitions, 588 flow [2025-01-09 21:33:58,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=281, PETRI_TRANSITIONS=273} [2025-01-09 21:33:58,840 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -68 predicate places. [2025-01-09 21:33:58,840 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 273 transitions, 588 flow [2025-01-09 21:33:58,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,841 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] [2025-01-09 21:33:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:58,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1084836584, now seen corresponding path program 1 times [2025-01-09 21:33:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304038958] [2025-01-09 21:33:58,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:33:58,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:33:58,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304038958] [2025-01-09 21:33:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304038958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493396194] [2025-01-09 21:33:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-01-09 21:33:58,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 273 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:58,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-01-09 21:33:58,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,069 INFO L124 PetriNetUnfolderBase]: 851/2192 cut-off events. [2025-01-09 21:33:59,070 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:59,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 2192 events. 851/2192 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15132 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3777. Up to 1232 conditions per place. [2025-01-09 21:33:59,080 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-01-09 21:33:59,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 272 transitions, 636 flow [2025-01-09 21:33:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-01-09 21:33:59,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-01-09 21:33:59,082 INFO L175 Difference]: Start difference. First operand has 281 places, 273 transitions, 588 flow. Second operand 3 states and 891 transitions. [2025-01-09 21:33:59,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 272 transitions, 636 flow [2025-01-09 21:33:59,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 616 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:59,085 INFO L231 Difference]: Finished difference. Result has 277 places, 272 transitions, 568 flow [2025-01-09 21:33:59,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=277, PETRI_TRANSITIONS=272} [2025-01-09 21:33:59,086 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2025-01-09 21:33:59,086 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 272 transitions, 568 flow [2025-01-09 21:33:59,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,087 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] [2025-01-09 21:33:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:59,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2141209519, now seen corresponding path program 1 times [2025-01-09 21:33:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514633123] [2025-01-09 21:33:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:33:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:33:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514633123] [2025-01-09 21:33:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514633123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063678712] [2025-01-09 21:33:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-01-09 21:33:59,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 272 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-01-09 21:33:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,432 INFO L124 PetriNetUnfolderBase]: 851/2191 cut-off events. [2025-01-09 21:33:59,432 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-09 21:33:59,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2191 events. 851/2191 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15204 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3764. Up to 1234 conditions per place. [2025-01-09 21:33:59,445 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-01-09 21:33:59,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 620 flow [2025-01-09 21:33:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-01-09 21:33:59,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-01-09 21:33:59,447 INFO L175 Difference]: Start difference. First operand has 277 places, 272 transitions, 568 flow. Second operand 3 states and 884 transitions. [2025-01-09 21:33:59,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 620 flow [2025-01-09 21:33:59,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 271 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:59,451 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 569 flow [2025-01-09 21:33:59,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-01-09 21:33:59,451 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2025-01-09 21:33:59,451 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 569 flow [2025-01-09 21:33:59,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,452 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] [2025-01-09 21:33:59,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:59,452 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-01-09 21:33:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1076496471, now seen corresponding path program 1 times [2025-01-09 21:33:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319398157] [2025-01-09 21:33:59,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:33:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:33:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319398157] [2025-01-09 21:33:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319398157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486535910] [2025-01-09 21:33:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-01-09 21:33:59,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-01-09 21:33:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,886 INFO L124 PetriNetUnfolderBase]: 1357/2994 cut-off events. [2025-01-09 21:33:59,886 INFO L125 PetriNetUnfolderBase]: For 613/614 co-relation queries the response was YES. [2025-01-09 21:33:59,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 2994 events. 1357/2994 cut-off events. For 613/614 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20416 event pairs, 460 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 5304. Up to 1440 conditions per place. [2025-01-09 21:33:59,900 INFO L140 encePairwiseOnDemand]: 361/369 looper letters, 0 selfloop transitions, 0 changer transitions 292/292 dead transitions. [2025-01-09 21:33:59,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 292 transitions, 718 flow [2025-01-09 21:33:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-01-09 21:33:59,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8220415537488708 [2025-01-09 21:33:59,902 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 569 flow. Second operand 3 states and 910 transitions. [2025-01-09 21:33:59,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 292 transitions, 718 flow [2025-01-09 21:33:59,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 292 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,905 INFO L231 Difference]: Finished difference. Result has 276 places, 0 transitions, 0 flow [2025-01-09 21:33:59,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=276, PETRI_TRANSITIONS=0} [2025-01-09 21:33:59,906 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -73 predicate places. [2025-01-09 21:33:59,906 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 0 transitions, 0 flow [2025-01-09 21:33:59,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (120 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (119 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (118 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (117 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (116 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (114 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (113 of 121 remaining) [2025-01-09 21:33:59,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (112 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (111 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (110 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (109 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (108 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (107 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (106 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (105 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (104 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (100 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (99 of 121 remaining) [2025-01-09 21:33:59,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (98 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (97 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (96 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (95 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (94 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (93 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (92 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (91 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (90 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (89 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (88 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (87 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (86 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (84 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (83 of 121 remaining) [2025-01-09 21:33:59,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (82 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (81 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (80 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (78 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (77 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (76 of 121 remaining) [2025-01-09 21:33:59,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (75 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 121 remaining) [2025-01-09 21:33:59,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (62 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (61 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (59 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (58 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (56 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 121 remaining) [2025-01-09 21:33:59,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (51 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (49 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (40 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (39 of 121 remaining) [2025-01-09 21:33:59,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (24 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (23 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (22 of 121 remaining) [2025-01-09 21:33:59,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (21 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (20 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (17 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (16 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (14 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (10 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (9 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 121 remaining) [2025-01-09 21:33:59,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (5 of 121 remaining) [2025-01-09 21:33:59,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (4 of 121 remaining) [2025-01-09 21:33:59,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 121 remaining) [2025-01-09 21:33:59,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 121 remaining) [2025-01-09 21:33:59,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 121 remaining) [2025-01-09 21:33:59,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 121 remaining) [2025-01-09 21:33:59,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:59,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:59,923 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:59,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:59,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:59 BasicIcfg [2025-01-09 21:33:59,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:59,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:59,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:59,928 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:59,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:52" (3/4) ... [2025-01-09 21:33:59,929 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:59,931 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:59,931 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:59,931 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:59,931 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:33:59,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-01-09 21:33:59,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:59,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:33:59,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:00,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:00,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:00,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:00,006 INFO L158 Benchmark]: Toolchain (without parser) took 8463.02ms. Allocated memory was 201.3MB in the beginning and 914.4MB in the end (delta: 713.0MB). Free memory was 155.8MB in the beginning and 364.0MB in the end (delta: -208.2MB). Peak memory consumption was 498.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,007 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:00,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.81ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 141.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 138.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,009 INFO L158 Benchmark]: Boogie Preprocessor took 24.73ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:00,009 INFO L158 Benchmark]: RCFGBuilder took 1024.41ms. Allocated memory is still 201.3MB. Free memory was 136.4MB in the beginning and 121.3MB in the end (delta: 15.0MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,010 INFO L158 Benchmark]: TraceAbstraction took 7064.60ms. Allocated memory was 201.3MB in the beginning and 914.4MB in the end (delta: 713.0MB). Free memory was 120.3MB in the beginning and 372.4MB in the end (delta: -252.1MB). Peak memory consumption was 456.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,010 INFO L158 Benchmark]: Witness Printer took 78.00ms. Allocated memory is still 914.4MB. Free memory was 372.4MB in the beginning and 364.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:00,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.81ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 141.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 138.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.73ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1024.41ms. Allocated memory is still 201.3MB. Free memory was 136.4MB in the beginning and 121.3MB in the end (delta: 15.0MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7064.60ms. Allocated memory was 201.3MB in the beginning and 914.4MB in the end (delta: 713.0MB). Free memory was 120.3MB in the beginning and 372.4MB in the end (delta: -252.1MB). Peak memory consumption was 456.7MB. Max. memory is 16.1GB. * Witness Printer took 78.00ms. Allocated memory is still 914.4MB. Free memory was 372.4MB in the beginning and 364.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 452 locations, 121 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 960 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 62 mSDtfsCounter, 960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 68 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:00,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE