./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:17:20,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:17:20,862 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:17:20,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:17:20,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:17:20,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:17:20,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:17:20,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:17:20,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:17:20,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:17:20,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:17:20,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:17:20,900 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:17:20,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:17:20,901 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:17:20,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:20,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:20,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:20,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:17:20,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:17:20,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:17:20,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:17:20,905 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2025-01-09 21:17:21,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:17:21,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:17:21,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:17:21,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:17:21,243 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:17:21,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-01-09 21:17:22,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff8f04223/ecd76708acc94d4caf16eeba4deb0480/FLAGad0fd5a97 [2025-01-09 21:17:23,016 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:17:23,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-01-09 21:17:23,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff8f04223/ecd76708acc94d4caf16eeba4deb0480/FLAGad0fd5a97 [2025-01-09 21:17:23,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff8f04223/ecd76708acc94d4caf16eeba4deb0480 [2025-01-09 21:17:23,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:17:23,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:17:23,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:23,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:17:23,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:17:23,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23, skipping insertion in model container [2025-01-09 21:17:23,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:17:23,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:23,736 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:17:23,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:23,877 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:23,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23 WrapperNode [2025-01-09 21:17:23,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:23,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:23,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:23,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:23,884 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:17:23" (1/1) ... [2025-01-09 21:17:23,903 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:17:23" (1/1) ... [2025-01-09 21:17:23,928 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219 [2025-01-09 21:17:23,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:23,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:23,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:23,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:23,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:23,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:23,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:23,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:23,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (1/1) ... [2025-01-09 21:17:23,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:24,022 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:17:24,025 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:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-09 21:17:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:24,050 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:17:24,287 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:24,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:24,739 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:24,739 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:24,799 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:24,799 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:17:24,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:24 BoogieIcfgContainer [2025-01-09 21:17:24,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:24,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:24,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:24,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:24,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:23" (1/3) ... [2025-01-09 21:17:24,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c8daf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:24, skipping insertion in model container [2025-01-09 21:17:24,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:23" (2/3) ... [2025-01-09 21:17:24,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c8daf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:24, skipping insertion in model container [2025-01-09 21:17:24,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:24" (3/3) ... [2025-01-09 21:17:24,808 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-01-09 21:17:24,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:24,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 272 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-01-09 21:17:24,823 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:24,897 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:17:24,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 624 flow [2025-01-09 21:17:25,091 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2025-01-09 21:17:25,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:17:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 389 events. 18/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 681 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 225. Up to 4 conditions per place. [2025-01-09 21:17:25,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 624 flow [2025-01-09 21:17:25,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 302 transitions, 616 flow [2025-01-09 21:17:25,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:25,138 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;@7ff4a64f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:25,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:17:25,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:25,152 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:17:25,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:25,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:25,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:25,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -169560373, now seen corresponding path program 1 times [2025-01-09 21:17:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349293811] [2025-01-09 21:17:25,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:25,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:17:25,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:17:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349293811] [2025-01-09 21:17:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349293811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35090525] [2025-01-09 21:17:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:26,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:26,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:26,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:26,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:26,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-01-09 21:17:26,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 302 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:26,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:26,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-01-09 21:17:26,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:26,984 INFO L124 PetriNetUnfolderBase]: 424/1680 cut-off events. [2025-01-09 21:17:26,984 INFO L125 PetriNetUnfolderBase]: For 30/40 co-relation queries the response was YES. [2025-01-09 21:17:26,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1680 events. 424/1680 cut-off events. For 30/40 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10920 event pairs, 423 based on Foata normal form. 60/1598 useless extension candidates. Maximal degree in co-relation 2166. Up to 755 conditions per place. [2025-01-09 21:17:27,011 INFO L140 encePairwiseOnDemand]: 281/305 looper letters, 44 selfloop transitions, 5 changer transitions 12/265 dead transitions. [2025-01-09 21:17:27,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 265 transitions, 640 flow [2025-01-09 21:17:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions. [2025-01-09 21:17:27,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2025-01-09 21:17:27,041 INFO L175 Difference]: Start difference. First operand has 295 places, 302 transitions, 616 flow. Second operand 6 states and 1454 transitions. [2025-01-09 21:17:27,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 265 transitions, 640 flow [2025-01-09 21:17:27,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 632 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:27,056 INFO L231 Difference]: Finished difference. Result has 271 places, 253 transitions, 520 flow [2025-01-09 21:17:27,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=271, PETRI_TRANSITIONS=253} [2025-01-09 21:17:27,064 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-01-09 21:17:27,064 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 253 transitions, 520 flow [2025-01-09 21:17:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:27,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:27,066 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] [2025-01-09 21:17:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:27,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash -444160478, now seen corresponding path program 1 times [2025-01-09 21:17:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:27,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144348711] [2025-01-09 21:17:27,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:27,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:17:27,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:17:27,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:27,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144348711] [2025-01-09 21:17:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144348711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553329564] [2025-01-09 21:17:27,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:27,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-01-09 21:17:27,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 253 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:27,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:27,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-01-09 21:17:27,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:28,202 INFO L124 PetriNetUnfolderBase]: 424/1667 cut-off events. [2025-01-09 21:17:28,202 INFO L125 PetriNetUnfolderBase]: For 5/15 co-relation queries the response was YES. [2025-01-09 21:17:28,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1667 events. 424/1667 cut-off events. For 5/15 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10818 event pairs, 423 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 2396. Up to 755 conditions per place. [2025-01-09 21:17:28,215 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 44 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-01-09 21:17:28,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 616 flow [2025-01-09 21:17:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2025-01-09 21:17:28,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7846994535519126 [2025-01-09 21:17:28,219 INFO L175 Difference]: Start difference. First operand has 271 places, 253 transitions, 520 flow. Second operand 6 states and 1436 transitions. [2025-01-09 21:17:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 616 flow [2025-01-09 21:17:28,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:28,226 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 518 flow [2025-01-09 21:17:28,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2025-01-09 21:17:28,230 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-01-09 21:17:28,230 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 518 flow [2025-01-09 21:17:28,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:28,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:28,231 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] [2025-01-09 21:17:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:28,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 527152214, now seen corresponding path program 1 times [2025-01-09 21:17:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233357496] [2025-01-09 21:17:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:28,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:17:28,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:17:28,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:28,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233357496] [2025-01-09 21:17:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233357496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:28,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780773263] [2025-01-09 21:17:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:28,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:28,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:29,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-01-09 21:17:29,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:29,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:29,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-01-09 21:17:29,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:29,256 INFO L124 PetriNetUnfolderBase]: 232/817 cut-off events. [2025-01-09 21:17:29,257 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-01-09 21:17:29,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 817 events. 232/817 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3940 event pairs, 210 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1195. Up to 415 conditions per place. [2025-01-09 21:17:29,263 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2025-01-09 21:17:29,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 595 flow [2025-01-09 21:17:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-01-09 21:17:29,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-01-09 21:17:29,272 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 518 flow. Second operand 6 states and 1530 transitions. [2025-01-09 21:17:29,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 255 transitions, 595 flow [2025-01-09 21:17:29,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:29,283 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 536 flow [2025-01-09 21:17:29,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2025-01-09 21:17:29,285 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-01-09 21:17:29,285 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 536 flow [2025-01-09 21:17:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:29,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:29,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] [2025-01-09 21:17:29,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:29,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:29,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash -318548957, now seen corresponding path program 1 times [2025-01-09 21:17:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510759615] [2025-01-09 21:17:29,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:29,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:17:29,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:17:29,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:29,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:29,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510759615] [2025-01-09 21:17:29,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510759615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:29,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:29,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120057442] [2025-01-09 21:17:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:29,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:29,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:29,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:29,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:30,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-01-09 21:17:30,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-01-09 21:17:30,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,387 INFO L124 PetriNetUnfolderBase]: 232/816 cut-off events. [2025-01-09 21:17:30,387 INFO L125 PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES. [2025-01-09 21:17:30,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 816 events. 232/816 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3912 event pairs, 210 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1001. Up to 415 conditions per place. [2025-01-09 21:17:30,393 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2025-01-09 21:17:30,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 254 transitions, 607 flow [2025-01-09 21:17:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-01-09 21:17:30,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-01-09 21:17:30,399 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 536 flow. Second operand 6 states and 1530 transitions. [2025-01-09 21:17:30,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 254 transitions, 607 flow [2025-01-09 21:17:30,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 597 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:30,404 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 538 flow [2025-01-09 21:17:30,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2025-01-09 21:17:30,405 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-01-09 21:17:30,406 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 538 flow [2025-01-09 21:17:30,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,407 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] [2025-01-09 21:17:30,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:30,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1158413599, now seen corresponding path program 1 times [2025-01-09 21:17:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547726789] [2025-01-09 21:17:30,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:17:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:17:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547726789] [2025-01-09 21:17:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547726789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035957461] [2025-01-09 21:17:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 305 [2025-01-09 21:17:30,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 305 [2025-01-09 21:17:30,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,608 INFO L124 PetriNetUnfolderBase]: 65/533 cut-off events. [2025-01-09 21:17:30,609 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-01-09 21:17:30,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 533 events. 65/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2168 event pairs, 40 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 291. Up to 130 conditions per place. [2025-01-09 21:17:30,613 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 19 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-01-09 21:17:30,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 252 transitions, 578 flow [2025-01-09 21:17:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-01-09 21:17:30,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-01-09 21:17:30,616 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 538 flow. Second operand 3 states and 805 transitions. [2025-01-09 21:17:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 252 transitions, 578 flow [2025-01-09 21:17:30,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 564 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:30,621 INFO L231 Difference]: Finished difference. Result has 254 places, 252 transitions, 526 flow [2025-01-09 21:17:30,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=254, PETRI_TRANSITIONS=252} [2025-01-09 21:17:30,622 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -41 predicate places. [2025-01-09 21:17:30,622 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 526 flow [2025-01-09 21:17:30,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,623 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] [2025-01-09 21:17:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:30,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 382536521, now seen corresponding path program 1 times [2025-01-09 21:17:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762694018] [2025-01-09 21:17:30,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:17:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:17:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762694018] [2025-01-09 21:17:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762694018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019751847] [2025-01-09 21:17:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-01-09 21:17:30,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-01-09 21:17:30,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:30,828 INFO L124 PetriNetUnfolderBase]: 67/489 cut-off events. [2025-01-09 21:17:30,828 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-01-09 21:17:30,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 489 events. 67/489 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1791 event pairs, 45 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 512. Up to 128 conditions per place. [2025-01-09 21:17:30,831 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-01-09 21:17:30,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 578 flow [2025-01-09 21:17:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2025-01-09 21:17:30,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2025-01-09 21:17:30,834 INFO L175 Difference]: Start difference. First operand has 254 places, 252 transitions, 526 flow. Second operand 3 states and 810 transitions. [2025-01-09 21:17:30,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 578 flow [2025-01-09 21:17:30,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:30,838 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow [2025-01-09 21:17:30,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2025-01-09 21:17:30,841 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -42 predicate places. [2025-01-09 21:17:30,841 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow [2025-01-09 21:17:30,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:30,842 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] [2025-01-09 21:17:30,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:30,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:30,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -21903332, now seen corresponding path program 1 times [2025-01-09 21:17:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-01-09 21:17:30,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:30,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:17:30,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:17:30,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:30,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-01-09 21:17:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804364886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:30,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:30,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148108845] [2025-01-09 21:17:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:30,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:30,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-01-09 21:17:30,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:30,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:30,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-01-09 21:17:30,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,054 INFO L124 PetriNetUnfolderBase]: 75/570 cut-off events. [2025-01-09 21:17:31,055 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:17:31,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 570 events. 75/570 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1948 event pairs, 18 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 592. Up to 90 conditions per place. [2025-01-09 21:17:31,059 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 20 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2025-01-09 21:17:31,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 580 flow [2025-01-09 21:17:31,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-01-09 21:17:31,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2025-01-09 21:17:31,062 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions. [2025-01-09 21:17:31,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 580 flow [2025-01-09 21:17:31,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:31,067 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 520 flow [2025-01-09 21:17:31,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-01-09 21:17:31,069 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-01-09 21:17:31,070 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 520 flow [2025-01-09 21:17:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:31,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,071 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] [2025-01-09 21:17:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:31,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1892654432, now seen corresponding path program 1 times [2025-01-09 21:17:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010085300] [2025-01-09 21:17:31,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:17:31,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:17:31,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010085300] [2025-01-09 21:17:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010085300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296920487] [2025-01-09 21:17:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:31,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:31,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 305 [2025-01-09 21:17:31,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:31,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:31,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 305 [2025-01-09 21:17:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:31,266 INFO L124 PetriNetUnfolderBase]: 64/680 cut-off events. [2025-01-09 21:17:31,266 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:17:31,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 680 events. 64/680 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2659 event pairs, 44 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 715. Up to 130 conditions per place. [2025-01-09 21:17:31,274 INFO L140 encePairwiseOnDemand]: 301/305 looper letters, 18 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-01-09 21:17:31,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 563 flow [2025-01-09 21:17:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2025-01-09 21:17:31,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874316939890711 [2025-01-09 21:17:31,277 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 520 flow. Second operand 3 states and 812 transitions. [2025-01-09 21:17:31,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 563 flow [2025-01-09 21:17:31,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:31,282 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 529 flow [2025-01-09 21:17:31,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-01-09 21:17:31,284 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-01-09 21:17:31,284 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 529 flow [2025-01-09 21:17:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:31,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:31,286 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] [2025-01-09 21:17:31,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:17:31,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:31,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash -448068810, now seen corresponding path program 1 times [2025-01-09 21:17:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:31,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982549231] [2025-01-09 21:17:31,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:31,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:17:31,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:17:31,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982549231] [2025-01-09 21:17:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982549231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126490596] [2025-01-09 21:17:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:31,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:31,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:32,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-01-09 21:17:32,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:32,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-01-09 21:17:32,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,517 INFO L124 PetriNetUnfolderBase]: 578/1738 cut-off events. [2025-01-09 21:17:32,518 INFO L125 PetriNetUnfolderBase]: For 171/173 co-relation queries the response was YES. [2025-01-09 21:17:32,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 578/1738 cut-off events. For 171/173 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10012 event pairs, 347 based on Foata normal form. 0/1659 useless extension candidates. Maximal degree in co-relation 2488. Up to 943 conditions per place. [2025-01-09 21:17:32,528 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 50 selfloop transitions, 30 changer transitions 0/279 dead transitions. [2025-01-09 21:17:32,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 279 transitions, 763 flow [2025-01-09 21:17:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-01-09 21:17:32,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-01-09 21:17:32,532 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 529 flow. Second operand 6 states and 1471 transitions. [2025-01-09 21:17:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 279 transitions, 763 flow [2025-01-09 21:17:32,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 279 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:32,539 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 747 flow [2025-01-09 21:17:32,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2025-01-09 21:17:32,542 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -33 predicate places. [2025-01-09 21:17:32,542 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 747 flow [2025-01-09 21:17:32,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:32,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,543 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:17:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:17:32,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:32,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash 44020556, now seen corresponding path program 1 times [2025-01-09 21:17:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530800392] [2025-01-09 21:17:32,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:17:32,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:17:32,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530800392] [2025-01-09 21:17:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530800392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:32,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774240990] [2025-01-09 21:17:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:32,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:32,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:32,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-01-09 21:17:32,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:32,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:32,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-01-09 21:17:32,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:32,815 INFO L124 PetriNetUnfolderBase]: 332/1161 cut-off events. [2025-01-09 21:17:32,815 INFO L125 PetriNetUnfolderBase]: For 614/635 co-relation queries the response was YES. [2025-01-09 21:17:32,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1161 events. 332/1161 cut-off events. For 614/635 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6043 event pairs, 99 based on Foata normal form. 2/1127 useless extension candidates. Maximal degree in co-relation 2135. Up to 403 conditions per place. [2025-01-09 21:17:32,828 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 50 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-01-09 21:17:32,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 286 transitions, 885 flow [2025-01-09 21:17:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-01-09 21:17:32,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8885245901639345 [2025-01-09 21:17:32,831 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 747 flow. Second operand 3 states and 813 transitions. [2025-01-09 21:17:32,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 286 transitions, 885 flow [2025-01-09 21:17:32,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 869 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:32,843 INFO L231 Difference]: Finished difference. Result has 263 places, 278 transitions, 733 flow [2025-01-09 21:17:32,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, 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=733, PETRI_PLACES=263, PETRI_TRANSITIONS=278} [2025-01-09 21:17:32,846 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -32 predicate places. [2025-01-09 21:17:32,846 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 278 transitions, 733 flow [2025-01-09 21:17:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:32,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:32,847 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] [2025-01-09 21:17:32,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:17:32,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1650094721, now seen corresponding path program 1 times [2025-01-09 21:17:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468596196] [2025-01-09 21:17:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:32,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:17:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:17:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:33,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468596196] [2025-01-09 21:17:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468596196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:33,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562194611] [2025-01-09 21:17:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:33,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:33,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:33,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:33,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-01-09 21:17:33,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:33,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:33,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-01-09 21:17:33,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:34,210 INFO L124 PetriNetUnfolderBase]: 828/2346 cut-off events. [2025-01-09 21:17:34,211 INFO L125 PetriNetUnfolderBase]: For 1095/1110 co-relation queries the response was YES. [2025-01-09 21:17:34,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 2346 events. 828/2346 cut-off events. For 1095/1110 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14887 event pairs, 419 based on Foata normal form. 0/2263 useless extension candidates. Maximal degree in co-relation 4958. Up to 1225 conditions per place. [2025-01-09 21:17:34,229 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 74 selfloop transitions, 30 changer transitions 0/307 dead transitions. [2025-01-09 21:17:34,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 1063 flow [2025-01-09 21:17:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-01-09 21:17:34,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-01-09 21:17:34,233 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 733 flow. Second operand 6 states and 1471 transitions. [2025-01-09 21:17:34,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 1063 flow [2025-01-09 21:17:34,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:34,242 INFO L231 Difference]: Finished difference. Result has 271 places, 307 transitions, 995 flow [2025-01-09 21:17:34,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=271, PETRI_TRANSITIONS=307} [2025-01-09 21:17:34,243 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-01-09 21:17:34,243 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 307 transitions, 995 flow [2025-01-09 21:17:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:34,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:34,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:17:34,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2041196530, now seen corresponding path program 1 times [2025-01-09 21:17:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642397503] [2025-01-09 21:17:34,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:17:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:17:34,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:34,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642397503] [2025-01-09 21:17:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642397503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668711097] [2025-01-09 21:17:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:34,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:35,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-01-09 21:17:35,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 307 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:35,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:35,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-01-09 21:17:35,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:35,698 INFO L124 PetriNetUnfolderBase]: 925/2870 cut-off events. [2025-01-09 21:17:35,699 INFO L125 PetriNetUnfolderBase]: For 2175/2200 co-relation queries the response was YES. [2025-01-09 21:17:35,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 2870 events. 925/2870 cut-off events. For 2175/2200 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19946 event pairs, 307 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 6300. Up to 1290 conditions per place. [2025-01-09 21:17:35,728 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 96 selfloop transitions, 27 changer transitions 0/336 dead transitions. [2025-01-09 21:17:35,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 336 transitions, 1415 flow [2025-01-09 21:17:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-01-09 21:17:35,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-01-09 21:17:35,733 INFO L175 Difference]: Start difference. First operand has 271 places, 307 transitions, 995 flow. Second operand 6 states and 1517 transitions. [2025-01-09 21:17:35,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 336 transitions, 1415 flow [2025-01-09 21:17:35,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 336 transitions, 1351 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:35,747 INFO L231 Difference]: Finished difference. Result has 280 places, 328 transitions, 1187 flow [2025-01-09 21:17:35,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=280, PETRI_TRANSITIONS=328} [2025-01-09 21:17:35,749 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places. [2025-01-09 21:17:35,749 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 328 transitions, 1187 flow [2025-01-09 21:17:35,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:35,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:35,750 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] [2025-01-09 21:17:35,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:17:35,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:35,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash 367805409, now seen corresponding path program 1 times [2025-01-09 21:17:35,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:35,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983031689] [2025-01-09 21:17:35,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:17:35,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:17:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983031689] [2025-01-09 21:17:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983031689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:36,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:36,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588977591] [2025-01-09 21:17:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:36,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-01-09 21:17:36,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 328 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:36,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:36,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-01-09 21:17:36,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:37,431 INFO L124 PetriNetUnfolderBase]: 1209/3474 cut-off events. [2025-01-09 21:17:37,431 INFO L125 PetriNetUnfolderBase]: For 4869/5090 co-relation queries the response was YES. [2025-01-09 21:17:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10182 conditions, 3474 events. 1209/3474 cut-off events. For 4869/5090 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24991 event pairs, 352 based on Foata normal form. 10/3353 useless extension candidates. Maximal degree in co-relation 8784. Up to 1593 conditions per place. [2025-01-09 21:17:37,466 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 110 selfloop transitions, 39 changer transitions 37/373 dead transitions. [2025-01-09 21:17:37,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 373 transitions, 1883 flow [2025-01-09 21:17:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-01-09 21:17:37,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-01-09 21:17:37,471 INFO L175 Difference]: Start difference. First operand has 280 places, 328 transitions, 1187 flow. Second operand 6 states and 1517 transitions. [2025-01-09 21:17:37,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 373 transitions, 1883 flow [2025-01-09 21:17:37,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 373 transitions, 1851 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:37,489 INFO L231 Difference]: Finished difference. Result has 289 places, 328 transitions, 1574 flow [2025-01-09 21:17:37,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=289, PETRI_TRANSITIONS=328} [2025-01-09 21:17:37,491 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -6 predicate places. [2025-01-09 21:17:37,491 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 328 transitions, 1574 flow [2025-01-09 21:17:37,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:37,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:37,492 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] [2025-01-09 21:17:37,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:17:37,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:37,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1396074371, now seen corresponding path program 1 times [2025-01-09 21:17:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655100663] [2025-01-09 21:17:37,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:37,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:17:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:17:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655100663] [2025-01-09 21:17:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655100663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309004741] [2025-01-09 21:17:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:37,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:37,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:37,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:37,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 305 [2025-01-09 21:17:37,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 328 transitions, 1574 flow. Second operand has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:37,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:37,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 305 [2025-01-09 21:17:37,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:37,883 INFO L124 PetriNetUnfolderBase]: 167/626 cut-off events. [2025-01-09 21:17:37,883 INFO L125 PetriNetUnfolderBase]: For 1272/1375 co-relation queries the response was YES. [2025-01-09 21:17:37,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 626 events. 167/626 cut-off events. For 1272/1375 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3102 event pairs, 15 based on Foata normal form. 6/610 useless extension candidates. Maximal degree in co-relation 1625. Up to 179 conditions per place. [2025-01-09 21:17:37,888 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-01-09 21:17:37,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow [2025-01-09 21:17:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2025-01-09 21:17:37,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721311475409836 [2025-01-09 21:17:37,892 INFO L175 Difference]: Start difference. First operand has 289 places, 328 transitions, 1574 flow. Second operand 6 states and 1596 transitions. [2025-01-09 21:17:37,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow [2025-01-09 21:17:37,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-01-09 21:17:37,896 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow [2025-01-09 21:17:37,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2025-01-09 21:17:37,898 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -119 predicate places. [2025-01-09 21:17:37,898 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow [2025-01-09 21:17:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:37,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:37,899 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] [2025-01-09 21:17:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:17:37,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:17:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash -691622201, now seen corresponding path program 1 times [2025-01-09 21:17:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:37,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677939953] [2025-01-09 21:17:37,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:37,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:17:37,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:17:37,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:37,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:37,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677939953] [2025-01-09 21:17:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677939953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:37,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:37,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952181836] [2025-01-09 21:17:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:37,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:37,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:37,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:38,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-01-09 21:17:38,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:38,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:38,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-01-09 21:17:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:38,056 INFO L124 PetriNetUnfolderBase]: 39/300 cut-off events. [2025-01-09 21:17:38,056 INFO L125 PetriNetUnfolderBase]: For 60/81 co-relation queries the response was YES. [2025-01-09 21:17:38,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 60/81 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 916 event pairs, 23 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 503. Up to 76 conditions per place. [2025-01-09 21:17:38,058 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2025-01-09 21:17:38,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow [2025-01-09 21:17:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2025-01-09 21:17:38,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892896174863388 [2025-01-09 21:17:38,060 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 817 transitions. [2025-01-09 21:17:38,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow [2025-01-09 21:17:38,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:38,062 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2025-01-09 21:17:38,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2025-01-09 21:17:38,063 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -122 predicate places. [2025-01-09 21:17:38,063 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2025-01-09 21:17:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:17:38,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-01-09 21:17:38,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-01-09 21:17:38,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-01-09 21:17:38,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-01-09 21:17:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:17:38,072 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:38,077 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:38,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:38,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:38 BasicIcfg [2025-01-09 21:17:38,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:38,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:38,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:38,086 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:38,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:24" (3/4) ... [2025-01-09 21:17:38,089 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:17:38,091 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-09 21:17:38,101 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-01-09 21:17:38,101 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:17:38,102 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:17:38,102 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:17:38,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:38,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:38,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:38,192 INFO L158 Benchmark]: Toolchain (without parser) took 14996.89ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.3MB in the beginning and 305.6MB in the end (delta: -195.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,193 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:38,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.92ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 78.5MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 75.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:38,194 INFO L158 Benchmark]: Boogie Preprocessor took 46.21ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 72.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,194 INFO L158 Benchmark]: RCFGBuilder took 823.67ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 99.7MB in the end (delta: -27.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,194 INFO L158 Benchmark]: TraceAbstraction took 13283.70ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 98.8MB in the beginning and 313.9MB in the end (delta: -215.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,194 INFO L158 Benchmark]: Witness Printer took 105.74ms. Allocated memory is still 419.4MB. Free memory was 313.9MB in the beginning and 305.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:38,196 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.92ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 78.5MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 75.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.21ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 72.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 823.67ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 99.7MB in the end (delta: -27.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13283.70ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 98.8MB in the beginning and 313.9MB in the end (delta: -215.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 105.74ms. Allocated memory is still 419.4MB. Free memory was 313.9MB in the beginning and 305.6MB 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: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3926]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3942]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3934]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3965]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3966]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3904]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: 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 4 procedures, 312 locations, 29 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: 13.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 135 mSDtfsCounter, 3559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred in iteration=13, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:17:38,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE