./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_3-container_of.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-2_3-container_of.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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:17:02,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:17:02,902 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:02,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:17:02,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:17:02,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:17:02,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:17:02,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:17:02,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:17:02,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:17:02,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:17:02,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:17:02,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:17:02,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:17:02,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:17:02,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:02,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:02,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:02,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:17:02,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:02,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:17:02,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:17:02,934 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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2025-01-09 21:17:03,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:17:03,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:17:03,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:17:03,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:17:03,142 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:17:03,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2025-01-09 21:17:04,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659c5f6e8/ef98afda1125428fbd7c067ee882f183/FLAGc78bcd8e2 [2025-01-09 21:17:04,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:17:04,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2025-01-09 21:17:04,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659c5f6e8/ef98afda1125428fbd7c067ee882f183/FLAGc78bcd8e2 [2025-01-09 21:17:04,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659c5f6e8/ef98afda1125428fbd7c067ee882f183 [2025-01-09 21:17:04,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:17:04,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:17:04,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:04,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:17:04,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:17:04,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:04" (1/1) ... [2025-01-09 21:17:04,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fed067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:04, skipping insertion in model container [2025-01-09 21:17:04,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:04" (1/1) ... [2025-01-09 21:17:04,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:17:04,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:04,860 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:17:04,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:04,954 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:04,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:04 WrapperNode [2025-01-09 21:17:04,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:04,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:04,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:04,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:04,962 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:04" (1/1) ... [2025-01-09 21:17:04,976 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:04" (1/1) ... [2025-01-09 21:17:05,000 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-01-09 21:17:05,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:05,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:05,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:05,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:05,008 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:04" (1/1) ... [2025-01-09 21:17:05,008 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:04" (1/1) ... [2025-01-09 21:17:05,013 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:04" (1/1) ... [2025-01-09 21:17:05,014 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:04" (1/1) ... [2025-01-09 21:17:05,032 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:04" (1/1) ... [2025-01-09 21:17:05,035 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:04" (1/1) ... [2025-01-09 21:17:05,037 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:04" (1/1) ... [2025-01-09 21:17:05,039 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:04" (1/1) ... [2025-01-09 21:17:05,040 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:04" (1/1) ... [2025-01-09 21:17:05,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:05,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:05,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:05,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:05,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:04" (1/1) ... [2025-01-09 21:17:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:05,083 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:05,086 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:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-09 21:17:05,105 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:17:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:17:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:17:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:17:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:05,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:05,108 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:05,307 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:05,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:05,676 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:05,676 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:05,779 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:05,780 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:17:05,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:05 BoogieIcfgContainer [2025-01-09 21:17:05,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:05,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:05,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:05,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:05,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:04" (1/3) ... [2025-01-09 21:17:05,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b7de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:05, skipping insertion in model container [2025-01-09 21:17:05,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:04" (2/3) ... [2025-01-09 21:17:05,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b7de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:05, skipping insertion in model container [2025-01-09 21:17:05,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:05" (3/3) ... [2025-01-09 21:17:05,786 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2025-01-09 21:17:05,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:05,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_3-container_of.i that has 2 procedures, 236 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-01-09 21:17:05,797 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:05,854 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:17:05,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 267 transitions, 548 flow [2025-01-09 21:17:05,962 INFO L124 PetriNetUnfolderBase]: 14/351 cut-off events. [2025-01-09 21:17:05,964 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:17:05,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 351 events. 14/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 679 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2025-01-09 21:17:05,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 267 transitions, 548 flow [2025-01-09 21:17:05,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 264 transitions, 540 flow [2025-01-09 21:17:05,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:05,995 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dd4ab8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:05,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:17:06,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:06,006 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:17:06,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:06,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:06,006 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:06,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -132741597, now seen corresponding path program 1 times [2025-01-09 21:17:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493830887] [2025-01-09 21:17:06,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:06,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:17:06,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:17:06,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:06,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:06,825 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:06,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493830887] [2025-01-09 21:17:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493830887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644562374] [2025-01-09 21:17:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:06,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:07,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-01-09 21:17:07,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 264 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call 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:07,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:07,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-01-09 21:17:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:07,824 INFO L124 PetriNetUnfolderBase]: 1296/4260 cut-off events. [2025-01-09 21:17:07,824 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:17:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6419 conditions, 4260 events. 1296/4260 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 34765 event pairs, 1295 based on Foata normal form. 140/4109 useless extension candidates. Maximal degree in co-relation 6156. Up to 2130 conditions per place. [2025-01-09 21:17:07,843 INFO L140 encePairwiseOnDemand]: 243/267 looper letters, 47 selfloop transitions, 5 changer transitions 6/233 dead transitions. [2025-01-09 21:17:07,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 233 transitions, 582 flow [2025-01-09 21:17:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-01-09 21:17:07,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634207240948814 [2025-01-09 21:17:07,855 INFO L175 Difference]: Start difference. First operand has 261 places, 264 transitions, 540 flow. Second operand 6 states and 1223 transitions. [2025-01-09 21:17:07,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 233 transitions, 582 flow [2025-01-09 21:17:07,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 233 transitions, 574 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:07,862 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 468 flow [2025-01-09 21:17:07,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2025-01-09 21:17:07,865 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -22 predicate places. [2025-01-09 21:17:07,866 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 468 flow [2025-01-09 21:17:07,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call 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:07,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:07,867 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:07,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:07,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:07,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2134588850, now seen corresponding path program 1 times [2025-01-09 21:17:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:07,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559611450] [2025-01-09 21:17:07,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:07,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:17:07,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:17:07,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:07,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559611450] [2025-01-09 21:17:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559611450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:08,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:08,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223555330] [2025-01-09 21:17:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:08,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-01-09 21:17:08,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call 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:08,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:08,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-01-09 21:17:08,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:08,849 INFO L124 PetriNetUnfolderBase]: 1296/4253 cut-off events. [2025-01-09 21:17:08,849 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:17:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 4253 events. 1296/4253 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 34705 event pairs, 1295 based on Foata normal form. 0/3965 useless extension candidates. Maximal degree in co-relation 6359. Up to 2130 conditions per place. [2025-01-09 21:17:08,869 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-01-09 21:17:08,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 226 transitions, 570 flow [2025-01-09 21:17:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2025-01-09 21:17:08,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521847690387016 [2025-01-09 21:17:08,873 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 468 flow. Second operand 6 states and 1205 transitions. [2025-01-09 21:17:08,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 226 transitions, 570 flow [2025-01-09 21:17:08,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 226 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:08,881 INFO L231 Difference]: Finished difference. Result has 232 places, 226 transitions, 466 flow [2025-01-09 21:17:08,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2025-01-09 21:17:08,884 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -29 predicate places. [2025-01-09 21:17:08,884 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 466 flow [2025-01-09 21:17:08,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call 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:08,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:08,885 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] [2025-01-09 21:17:08,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:08,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash -118367641, now seen corresponding path program 1 times [2025-01-09 21:17:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:08,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839952532] [2025-01-09 21:17:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:08,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:17:08,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:17:08,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:08,967 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:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839952532] [2025-01-09 21:17:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839952532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:08,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185322879] [2025-01-09 21:17:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:08,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:08,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:08,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:08,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-01-09 21:17:08,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call 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:08,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:08,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-01-09 21:17:08,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:09,263 INFO L124 PetriNetUnfolderBase]: 401/2397 cut-off events. [2025-01-09 21:17:09,264 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:17:09,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 2397 events. 401/2397 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 18563 event pairs, 395 based on Foata normal form. 0/2210 useless extension candidates. Maximal degree in co-relation 3039. Up to 670 conditions per place. [2025-01-09 21:17:09,276 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-01-09 21:17:09,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 230 transitions, 534 flow [2025-01-09 21:17:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-01-09 21:17:09,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589263420724095 [2025-01-09 21:17:09,278 INFO L175 Difference]: Start difference. First operand has 232 places, 226 transitions, 466 flow. Second operand 3 states and 688 transitions. [2025-01-09 21:17:09,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 230 transitions, 534 flow [2025-01-09 21:17:09,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 524 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:09,284 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 458 flow [2025-01-09 21:17:09,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2025-01-09 21:17:09,285 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -33 predicate places. [2025-01-09 21:17:09,285 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 458 flow [2025-01-09 21:17:09,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call 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:09,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:09,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] [2025-01-09 21:17:09,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:09,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1636350122, now seen corresponding path program 1 times [2025-01-09 21:17:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69215772] [2025-01-09 21:17:09,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:09,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:17:09,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:17:09,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:09,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:09,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69215772] [2025-01-09 21:17:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69215772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:09,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729771472] [2025-01-09 21:17:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:09,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:09,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:09,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:09,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-01-09 21:17:09,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call 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:09,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:09,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-01-09 21:17:09,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:09,587 INFO L124 PetriNetUnfolderBase]: 395/2386 cut-off events. [2025-01-09 21:17:09,588 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:17:09,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 2386 events. 395/2386 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17661 event pairs, 270 based on Foata normal form. 0/2214 useless extension candidates. Maximal degree in co-relation 2919. Up to 458 conditions per place. [2025-01-09 21:17:09,598 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/234 dead transitions. [2025-01-09 21:17:09,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 234 transitions, 538 flow [2025-01-09 21:17:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-01-09 21:17:09,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2025-01-09 21:17:09,600 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 458 flow. Second operand 3 states and 701 transitions. [2025-01-09 21:17:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 234 transitions, 538 flow [2025-01-09 21:17:09,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 234 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:09,602 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 454 flow [2025-01-09 21:17:09,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-01-09 21:17:09,604 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-01-09 21:17:09,604 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 454 flow [2025-01-09 21:17:09,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call 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:09,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:09,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:09,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 112182595, now seen corresponding path program 1 times [2025-01-09 21:17:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663415830] [2025-01-09 21:17:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:17:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:17:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663415830] [2025-01-09 21:17:09,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663415830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:09,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282347185] [2025-01-09 21:17:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:09,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:09,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:09,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:09,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-01-09 21:17:09,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call 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:09,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:09,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-01-09 21:17:09,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:09,951 INFO L124 PetriNetUnfolderBase]: 415/3805 cut-off events. [2025-01-09 21:17:09,951 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:17:09,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 3805 events. 415/3805 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 34275 event pairs, 185 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 4279. Up to 619 conditions per place. [2025-01-09 21:17:09,964 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 33 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-01-09 21:17:09,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 542 flow [2025-01-09 21:17:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-01-09 21:17:09,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2025-01-09 21:17:09,967 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 454 flow. Second operand 3 states and 693 transitions. [2025-01-09 21:17:09,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 542 flow [2025-01-09 21:17:09,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 233 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:09,973 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 455 flow [2025-01-09 21:17:09,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2025-01-09 21:17:09,973 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-01-09 21:17:09,973 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 455 flow [2025-01-09 21:17:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call 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:09,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:09,974 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] [2025-01-09 21:17:09,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:09,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:09,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1407871838, now seen corresponding path program 1 times [2025-01-09 21:17:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996301006] [2025-01-09 21:17:09,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:09,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:17:09,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:17:09,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:09,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996301006] [2025-01-09 21:17:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996301006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:10,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731682197] [2025-01-09 21:17:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:10,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:10,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:10,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-01-09 21:17:10,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call 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:10,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:10,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-01-09 21:17:10,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,978 INFO L124 PetriNetUnfolderBase]: 1487/4669 cut-off events. [2025-01-09 21:17:10,978 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:17:10,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 4669 events. 1487/4669 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 37087 event pairs, 1027 based on Foata normal form. 0/4435 useless extension candidates. Maximal degree in co-relation 6952. Up to 2116 conditions per place. [2025-01-09 21:17:10,997 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 61 selfloop transitions, 30 changer transitions 7/268 dead transitions. [2025-01-09 21:17:10,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 268 transitions, 733 flow [2025-01-09 21:17:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-01-09 21:17:11,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-01-09 21:17:11,000 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 455 flow. Second operand 6 states and 1271 transitions. [2025-01-09 21:17:11,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 268 transitions, 733 flow [2025-01-09 21:17:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 268 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:11,005 INFO L231 Difference]: Finished difference. Result has 235 places, 245 transitions, 639 flow [2025-01-09 21:17:11,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=235, PETRI_TRANSITIONS=245} [2025-01-09 21:17:11,006 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -26 predicate places. [2025-01-09 21:17:11,007 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 245 transitions, 639 flow [2025-01-09 21:17:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call 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:11,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:11,007 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] [2025-01-09 21:17:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:11,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 722383976, now seen corresponding path program 1 times [2025-01-09 21:17:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981181185] [2025-01-09 21:17:11,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:11,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:17:11,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:17:11,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:11,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981181185] [2025-01-09 21:17:11,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981181185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:11,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:11,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019303418] [2025-01-09 21:17:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:11,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:11,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:11,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:11,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-01-09 21:17:11,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 245 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call 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:11,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:11,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-01-09 21:17:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:12,367 INFO L124 PetriNetUnfolderBase]: 1749/4691 cut-off events. [2025-01-09 21:17:12,367 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-01-09 21:17:12,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9261 conditions, 4691 events. 1749/4691 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 35568 event pairs, 1009 based on Foata normal form. 0/4504 useless extension candidates. Maximal degree in co-relation 3116. Up to 2310 conditions per place. [2025-01-09 21:17:12,383 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 84 selfloop transitions, 30 changer transitions 11/290 dead transitions. [2025-01-09 21:17:12,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 290 transitions, 1007 flow [2025-01-09 21:17:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1268 transitions. [2025-01-09 21:17:12,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915106117353309 [2025-01-09 21:17:12,386 INFO L175 Difference]: Start difference. First operand has 235 places, 245 transitions, 639 flow. Second operand 6 states and 1268 transitions. [2025-01-09 21:17:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 290 transitions, 1007 flow [2025-01-09 21:17:12,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 290 transitions, 1007 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:12,394 INFO L231 Difference]: Finished difference. Result has 238 places, 263 transitions, 867 flow [2025-01-09 21:17:12,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=238, PETRI_TRANSITIONS=263} [2025-01-09 21:17:12,395 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -23 predicate places. [2025-01-09 21:17:12,396 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 263 transitions, 867 flow [2025-01-09 21:17:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call 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:12,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:12,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:12,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1575062284, now seen corresponding path program 1 times [2025-01-09 21:17:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048918066] [2025-01-09 21:17:12,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:12,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:17:12,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:17:12,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:12,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048918066] [2025-01-09 21:17:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048918066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:12,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:12,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226576340] [2025-01-09 21:17:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:12,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:12,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:12,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:12,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:12,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-01-09 21:17:12,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 263 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call 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:12,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:12,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-01-09 21:17:12,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:13,604 INFO L124 PetriNetUnfolderBase]: 1891/5022 cut-off events. [2025-01-09 21:17:13,604 INFO L125 PetriNetUnfolderBase]: For 2754/2802 co-relation queries the response was YES. [2025-01-09 21:17:13,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11853 conditions, 5022 events. 1891/5022 cut-off events. For 2754/2802 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 39667 event pairs, 879 based on Foata normal form. 0/4881 useless extension candidates. Maximal degree in co-relation 7071. Up to 2453 conditions per place. [2025-01-09 21:17:13,627 INFO L140 encePairwiseOnDemand]: 251/267 looper letters, 115 selfloop transitions, 26 changer transitions 0/307 dead transitions. [2025-01-09 21:17:13,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 307 transitions, 1337 flow [2025-01-09 21:17:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1273 transitions. [2025-01-09 21:17:13,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7946317103620475 [2025-01-09 21:17:13,630 INFO L175 Difference]: Start difference. First operand has 238 places, 263 transitions, 867 flow. Second operand 6 states and 1273 transitions. [2025-01-09 21:17:13,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 307 transitions, 1337 flow [2025-01-09 21:17:13,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 307 transitions, 1289 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:13,640 INFO L231 Difference]: Finished difference. Result has 236 places, 283 transitions, 1051 flow [2025-01-09 21:17:13,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=236, PETRI_TRANSITIONS=283} [2025-01-09 21:17:13,641 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-01-09 21:17:13,641 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 283 transitions, 1051 flow [2025-01-09 21:17:13,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call 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:13,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:13,642 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] [2025-01-09 21:17:13,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:17:13,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:13,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1999827901, now seen corresponding path program 1 times [2025-01-09 21:17:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196311830] [2025-01-09 21:17:13,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:17:13,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:17:13,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196311830] [2025-01-09 21:17:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196311830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092843971] [2025-01-09 21:17:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:13,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:13,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:14,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-01-09 21:17:14,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 283 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call 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:14,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:14,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-01-09 21:17:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:14,791 INFO L124 PetriNetUnfolderBase]: 2271/5539 cut-off events. [2025-01-09 21:17:14,791 INFO L125 PetriNetUnfolderBase]: For 5610/5782 co-relation queries the response was YES. [2025-01-09 21:17:14,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14864 conditions, 5539 events. 2271/5539 cut-off events. For 5610/5782 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 42615 event pairs, 975 based on Foata normal form. 70/5455 useless extension candidates. Maximal degree in co-relation 9523. Up to 2837 conditions per place. [2025-01-09 21:17:14,816 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 128 selfloop transitions, 36 changer transitions 37/342 dead transitions. [2025-01-09 21:17:14,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 342 transitions, 1771 flow [2025-01-09 21:17:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-01-09 21:17:14,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-01-09 21:17:14,819 INFO L175 Difference]: Start difference. First operand has 236 places, 283 transitions, 1051 flow. Second operand 6 states and 1271 transitions. [2025-01-09 21:17:14,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 342 transitions, 1771 flow [2025-01-09 21:17:14,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 342 transitions, 1771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:14,830 INFO L231 Difference]: Finished difference. Result has 244 places, 281 transitions, 1383 flow [2025-01-09 21:17:14,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1383, PETRI_PLACES=244, PETRI_TRANSITIONS=281} [2025-01-09 21:17:14,831 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -17 predicate places. [2025-01-09 21:17:14,831 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 281 transitions, 1383 flow [2025-01-09 21:17:14,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call 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:14,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:14,832 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] [2025-01-09 21:17:14,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:17:14,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash 680198257, now seen corresponding path program 1 times [2025-01-09 21:17:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118545785] [2025-01-09 21:17:14,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:14,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:17:14,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:17:14,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:14,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:14,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:14,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118545785] [2025-01-09 21:17:14,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118545785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:14,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:14,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834174391] [2025-01-09 21:17:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:14,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:14,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:14,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2025-01-09 21:17:14,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 281 transitions, 1383 flow. Second operand has 5 states, 5 states have (on average 218.2) internal successors, (1091), 5 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call 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:14,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:14,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2025-01-09 21:17:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:15,183 INFO L124 PetriNetUnfolderBase]: 575/1462 cut-off events. [2025-01-09 21:17:15,183 INFO L125 PetriNetUnfolderBase]: For 1973/1973 co-relation queries the response was YES. [2025-01-09 21:17:15,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 1462 events. 575/1462 cut-off events. For 1973/1973 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9428 event pairs, 270 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 3675. Up to 460 conditions per place. [2025-01-09 21:17:15,192 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 61 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2025-01-09 21:17:15,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 662 flow [2025-01-09 21:17:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-01-09 21:17:15,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-01-09 21:17:15,195 INFO L175 Difference]: Start difference. First operand has 244 places, 281 transitions, 1383 flow. Second operand 6 states and 1356 transitions. [2025-01-09 21:17:15,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 662 flow [2025-01-09 21:17:15,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 522 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-01-09 21:17:15,200 INFO L231 Difference]: Finished difference. Result has 150 places, 124 transitions, 272 flow [2025-01-09 21:17:15,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=150, PETRI_TRANSITIONS=124} [2025-01-09 21:17:15,201 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -111 predicate places. [2025-01-09 21:17:15,202 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 124 transitions, 272 flow [2025-01-09 21:17:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.2) internal successors, (1091), 5 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call 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:15,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:15,203 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] [2025-01-09 21:17:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:17:15,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:17:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 204042461, now seen corresponding path program 1 times [2025-01-09 21:17:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671204421] [2025-01-09 21:17:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:15,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:17:15,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:17:15,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:15,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:17:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671204421] [2025-01-09 21:17:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671204421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896059596] [2025-01-09 21:17:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:15,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:15,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-01-09 21:17:15,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 124 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call 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:15,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:15,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-01-09 21:17:15,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:15,376 INFO L124 PetriNetUnfolderBase]: 290/976 cut-off events. [2025-01-09 21:17:15,376 INFO L125 PetriNetUnfolderBase]: For 125/127 co-relation queries the response was YES. [2025-01-09 21:17:15,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 976 events. 290/976 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5925 event pairs, 280 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 1768. Up to 479 conditions per place. [2025-01-09 21:17:15,380 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-01-09 21:17:15,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 128 transitions, 336 flow [2025-01-09 21:17:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2025-01-09 21:17:15,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867665418227216 [2025-01-09 21:17:15,384 INFO L175 Difference]: Start difference. First operand has 150 places, 124 transitions, 272 flow. Second operand 3 states and 695 transitions. [2025-01-09 21:17:15,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 128 transitions, 336 flow [2025-01-09 21:17:15,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:15,386 INFO L231 Difference]: Finished difference. Result has 147 places, 0 transitions, 0 flow [2025-01-09 21:17:15,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=147, PETRI_TRANSITIONS=0} [2025-01-09 21:17:15,387 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -114 predicate places. [2025-01-09 21:17:15,387 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 0 transitions, 0 flow [2025-01-09 21:17:15,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call 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:15,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-01-09 21:17:15,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-01-09 21:17:15,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-01-09 21:17:15,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-01-09 21:17:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:17:15,396 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:15,401 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:15,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:15,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:15 BasicIcfg [2025-01-09 21:17:15,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:15,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:15,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:15,409 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:15,410 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:05" (3/4) ... [2025-01-09 21:17:15,412 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:17:15,414 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-09 21:17:15,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:17:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:17:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:17:15,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:17:15,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:15,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:15,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:15,487 INFO L158 Benchmark]: Toolchain (without parser) took 10895.06ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 108.1MB in the beginning and 443.5MB in the end (delta: -335.4MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,487 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:15,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.12ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 76.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:15,488 INFO L158 Benchmark]: Boogie Preprocessor took 45.44ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 68.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,489 INFO L158 Benchmark]: RCFGBuilder took 733.13ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 86.9MB in the end (delta: -18.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,489 INFO L158 Benchmark]: TraceAbstraction took 9626.92ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 86.2MB in the beginning and 447.8MB in the end (delta: -361.6MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,489 INFO L158 Benchmark]: Witness Printer took 76.29ms. Allocated memory is still 662.7MB. Free memory was 447.8MB in the beginning and 443.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:15,490 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.12ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 76.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.44ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 68.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 733.13ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 86.9MB in the end (delta: -18.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9626.92ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 86.2MB in the beginning and 447.8MB in the end (delta: -361.6MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. * Witness Printer took 76.29ms. Allocated memory is still 662.7MB. Free memory was 447.8MB in the beginning and 443.5MB in the end (delta: 4.3MB). 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: 3929]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3951]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3973]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3952]: 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: 3936]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3939]: 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: 3974]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3970]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3907]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3910]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3913]: 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, 280 locations, 27 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: 9.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1088 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2938 IncrementalHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 72 mSDtfsCounter, 2938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 8/8 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:15,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE