./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/pthread-divine/ring_1w1r-2.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 b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:29:12,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:29:12,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:29:12,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:29:12,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:29:12,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:29:12,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:29:12,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:29:12,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:29:12,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:29:12,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:29:12,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:29:12,187 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:29:12,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:29:12,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:29:12,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:29:12,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:29:12,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:12,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:29:12,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:29:12,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:29:12,189 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 -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2025-02-08 05:29:12,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:29:12,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:29:12,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:29:12,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:29:12,506 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:29:12,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-02-08 05:29:13,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32c719707/de07a96365c6446aba3f3471618952d2/FLAG9299c646b [2025-02-08 05:29:14,139 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:29:14,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-02-08 05:29:14,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32c719707/de07a96365c6446aba3f3471618952d2/FLAG9299c646b [2025-02-08 05:29:14,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32c719707/de07a96365c6446aba3f3471618952d2 [2025-02-08 05:29:14,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:29:14,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:29:14,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:14,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:29:14,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:29:14,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14, skipping insertion in model container [2025-02-08 05:29:14,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:29:14,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:14,555 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:29:14,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:14,669 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:29:14,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14 WrapperNode [2025-02-08 05:29:14,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:14,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:14,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:29:14,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:29:14,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,749 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-02-08 05:29:14,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:14,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:29:14,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:29:14,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:29:14,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:29:14,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:29:14,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:29:14,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:29:14,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (1/1) ... [2025-02-08 05:29:14,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:14,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:29:14,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:29:14,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:29:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-02-08 05:29:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-02-08 05:29:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:29:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:29:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:29:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:29:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:29:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:29:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:29:14,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:29:14,885 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:29:15,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:29:15,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume false; [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-4: assume !false; [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L803-5: assume false; [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-02-08 05:29:15,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: assume 0 != #t~ret18#1 % 256; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: assume !(0 != #t~ret18#1 % 256); [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829-1: havoc #t~ret18#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829-2: havoc #t~ret18#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829-3: havoc ring_empty_#in~r#1.base, ring_empty_#in~r#1.offset;assume { :end_inline_ring_empty } true; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829-4: havoc ring_empty_#t~mem14#1, ring_empty_#t~mem15#1, ring_empty_~r#1.base, ring_empty_~r#1.offset; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L829-5: #t~ret18#1 := ring_empty_#res#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset := ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: havoc #t~ret19#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-1: ~val~0#1 := #t~ret19#1; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-2: assume { :end_inline_ring_dequeue } true;assume -2147483648 <= #t~ret19#1 && #t~ret19#1 <= 2147483647; [2025-02-08 05:29:15,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-3: havoc ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset; [2025-02-08 05:29:15,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-4: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-5: #t~ret19#1 := ring_dequeue_#res#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-6: havoc ring_dequeue_#t~mem10#1, ring_dequeue_#t~mem11#1, ring_dequeue_#t~mem12#1, ring_dequeue_#t~nondet13#1, ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, ring_dequeue_~x~0#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-7: havoc ring_dequeue_#res#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-8: assume { :begin_inline_ring_dequeue } true;ring_dequeue_#in~r#1.base, ring_dequeue_#in~r#1.offset := ~r~0#1.base, ~r~0#1.offset; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc ring_dequeue_#t~mem11#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-1: havoc ring_dequeue_#t~mem10#1; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume ((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]; [2025-02-08 05:29:15,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-2: assume !(((0 == #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1] && 0 == #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]) && 0 == #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1)]); [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-3: ring_dequeue_~x~0#1 := ring_dequeue_#t~mem11#1; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-4: #race := #race[ring_dequeue_~r#1.base,3 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-5: #race := #race[ring_dequeue_~r#1.base,2 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-6: #race := #race[ring_dequeue_~r#1.base,1 + (4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1) := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-7: #race := #race[ring_dequeue_~r#1.base,4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1 := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-8: SUMMARY for call ring_dequeue_#t~mem11#1 := read~int(ring_dequeue_~r#1.base, 4 + ring_dequeue_~r#1.offset + 4 * ring_dequeue_#t~mem10#1, 4); srcloc: null [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L815-14: SUMMARY for call ring_dequeue_#t~mem10#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L832: havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset;assume { :end_inline_reach_error } true; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L832-1: assume !(~val~0#1 == 1 + ~last~0#1); [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L832-1: assume !!(~val~0#1 == 1 + ~last~0#1); [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L832-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet3#1.base, reach_error_#t~nondet3#1.offset; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume ((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: assume !(((#race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1 && #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1) && #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset] == ring_dequeue_#t~nondet13#1); [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-2: havoc ring_dequeue_#t~mem12#1; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-3: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-4: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-5: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-6: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := ring_dequeue_#t~nondet13#1]; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-7: havoc ring_dequeue_#t~nondet13#1; [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-8: SUMMARY for call write~int((if 1 + ring_dequeue_#t~mem12#1 < 0 && 0 != (1 + ring_dequeue_#t~mem12#1) % 4 then (1 + ring_dequeue_#t~mem12#1) % 4 - 4 else (1 + ring_dequeue_#t~mem12#1) % 4), ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:15,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume ((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]; [2025-02-08 05:29:15,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-9: assume !(((0 == #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset] && 0 == #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset]) && 0 == #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset]); [2025-02-08 05:29:15,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-10: #race := #race[ring_dequeue_~r#1.base,3 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-11: #race := #race[ring_dequeue_~r#1.base,2 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-12: #race := #race[ring_dequeue_~r#1.base,1 + ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,285 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-13: #race := #race[ring_dequeue_~r#1.base,ring_dequeue_~r#1.offset := 0]; [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-14: SUMMARY for call ring_dequeue_#t~mem12#1 := read~int(ring_dequeue_~r#1.base, ring_dequeue_~r#1.offset, 4); srcloc: null [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: ~last~0#1 := ~val~0#1; [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817-1: ring_dequeue_#res#1 := ring_dequeue_~x~0#1; [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834: havoc #t~pre20#1; [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-1: ~i~0#1 := 1 + ~i~0#1; [2025-02-08 05:29:15,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L834-2: #t~pre20#1 := 1 + ~i~0#1; [2025-02-08 05:29:15,484 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:29:15,484 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:29:15,503 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:29:15,503 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:29:15,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:15 BoogieIcfgContainer [2025-02-08 05:29:15,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:29:15,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:29:15,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:29:15,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:29:15,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:29:14" (1/3) ... [2025-02-08 05:29:15,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215b0b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:15, skipping insertion in model container [2025-02-08 05:29:15,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:14" (2/3) ... [2025-02-08 05:29:15,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215b0b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:15, skipping insertion in model container [2025-02-08 05:29:15,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:15" (3/3) ... [2025-02-08 05:29:15,515 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-02-08 05:29:15,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:29:15,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-2.i that has 2 procedures, 195 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 05:29:15,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:29:15,618 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:29:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 201 transitions, 409 flow [2025-02-08 05:29:15,750 INFO L124 PetriNetUnfolderBase]: 7/200 cut-off events. [2025-02-08 05:29:15,753 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:29:15,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 200 events. 7/200 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 417 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2025-02-08 05:29:15,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 201 transitions, 409 flow [2025-02-08 05:29:15,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 194 transitions, 391 flow [2025-02-08 05:29:15,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:29:15,793 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;@31252942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:29:15,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 05:29:15,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:29:15,808 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-02-08 05:29:15,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:15,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:15,809 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] [2025-02-08 05:29:15,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:15,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1112074736, now seen corresponding path program 1 times [2025-02-08 05:29:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-02-08 05:29:15,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:15,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:29:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:29:15,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-02-08 05:29:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700583689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:16,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:16,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288119659] [2025-02-08 05:29:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:16,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:16,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:16,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:16,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:17,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 201 [2025-02-08 05:29:17,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 194 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:17,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:17,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 201 [2025-02-08 05:29:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:17,473 INFO L124 PetriNetUnfolderBase]: 418/1826 cut-off events. [2025-02-08 05:29:17,473 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:29:17,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1826 events. 418/1826 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12579 event pairs, 384 based on Foata normal form. 123/1783 useless extension candidates. Maximal degree in co-relation 2607. Up to 831 conditions per place. [2025-02-08 05:29:17,493 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 46 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-02-08 05:29:17,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 186 transitions, 477 flow [2025-02-08 05:29:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2025-02-08 05:29:17,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7587064676616916 [2025-02-08 05:29:17,519 INFO L175 Difference]: Start difference. First operand has 191 places, 194 transitions, 391 flow. Second operand 6 states and 915 transitions. [2025-02-08 05:29:17,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 186 transitions, 477 flow [2025-02-08 05:29:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 186 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:29:17,531 INFO L231 Difference]: Finished difference. Result has 192 places, 186 transitions, 384 flow [2025-02-08 05:29:17,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=192, PETRI_TRANSITIONS=186} [2025-02-08 05:29:17,538 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 1 predicate places. [2025-02-08 05:29:17,541 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 186 transitions, 384 flow [2025-02-08 05:29:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:17,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:17,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:29:17,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 126194326, now seen corresponding path program 1 times [2025-02-08 05:29:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-02-08 05:29:17,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:17,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:29:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:29:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:17,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-02-08 05:29:17,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752647101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:17,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:17,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445388523] [2025-02-08 05:29:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:17,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:17,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:17,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:17,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:18,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 201 [2025-02-08 05:29:18,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 186 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:18,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:18,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 201 [2025-02-08 05:29:18,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:18,528 INFO L124 PetriNetUnfolderBase]: 418/1825 cut-off events. [2025-02-08 05:29:18,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:18,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 1825 events. 418/1825 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12611 event pairs, 384 based on Foata normal form. 0/1660 useless extension candidates. Maximal degree in co-relation 2619. Up to 831 conditions per place. [2025-02-08 05:29:18,540 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 46 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-02-08 05:29:18,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 185 transitions, 484 flow [2025-02-08 05:29:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 910 transitions. [2025-02-08 05:29:18,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7545605306799337 [2025-02-08 05:29:18,544 INFO L175 Difference]: Start difference. First operand has 192 places, 186 transitions, 384 flow. Second operand 6 states and 910 transitions. [2025-02-08 05:29:18,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 185 transitions, 484 flow [2025-02-08 05:29:18,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 185 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:18,548 INFO L231 Difference]: Finished difference. Result has 191 places, 185 transitions, 382 flow [2025-02-08 05:29:18,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=191, PETRI_TRANSITIONS=185} [2025-02-08 05:29:18,549 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 0 predicate places. [2025-02-08 05:29:18,549 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 185 transitions, 382 flow [2025-02-08 05:29:18,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:18,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:18,550 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] [2025-02-08 05:29:18,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:29:18,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:18,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1187499288, now seen corresponding path program 1 times [2025-02-08 05:29:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815954193] [2025-02-08 05:29:18,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:18,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:29:18,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:29:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815954193] [2025-02-08 05:29:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815954193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968508510] [2025-02-08 05:29:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:18,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:18,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:18,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:19,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201 [2025-02-08 05:29:19,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 185 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:19,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:19,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201 [2025-02-08 05:29:19,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:19,680 INFO L124 PetriNetUnfolderBase]: 240/1760 cut-off events. [2025-02-08 05:29:19,681 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:29:19,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 1760 events. 240/1760 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12063 event pairs, 40 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 2189. Up to 366 conditions per place. [2025-02-08 05:29:19,688 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 32 selfloop transitions, 43 changer transitions 0/226 dead transitions. [2025-02-08 05:29:19,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 226 transitions, 614 flow [2025-02-08 05:29:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-02-08 05:29:19,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8648424543946932 [2025-02-08 05:29:19,694 INFO L175 Difference]: Start difference. First operand has 191 places, 185 transitions, 382 flow. Second operand 6 states and 1043 transitions. [2025-02-08 05:29:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 226 transitions, 614 flow [2025-02-08 05:29:19,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 226 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:29:19,706 INFO L231 Difference]: Finished difference. Result has 196 places, 226 transitions, 664 flow [2025-02-08 05:29:19,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=196, PETRI_TRANSITIONS=226} [2025-02-08 05:29:19,708 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 5 predicate places. [2025-02-08 05:29:19,708 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 226 transitions, 664 flow [2025-02-08 05:29:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:19,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:19,709 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-02-08 05:29:19,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:29:19,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 360815012, now seen corresponding path program 1 times [2025-02-08 05:29:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499495219] [2025-02-08 05:29:19,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:29:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:29:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499495219] [2025-02-08 05:29:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499495219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623666173] [2025-02-08 05:29:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:20,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:20,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:20,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:20,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 201 [2025-02-08 05:29:20,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 226 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:20,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:20,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 201 [2025-02-08 05:29:20,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:20,705 INFO L124 PetriNetUnfolderBase]: 160/1430 cut-off events. [2025-02-08 05:29:20,706 INFO L125 PetriNetUnfolderBase]: For 325/397 co-relation queries the response was YES. [2025-02-08 05:29:20,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 1430 events. 160/1430 cut-off events. For 325/397 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9353 event pairs, 8 based on Foata normal form. 40/1393 useless extension candidates. Maximal degree in co-relation 2368. Up to 235 conditions per place. [2025-02-08 05:29:20,714 INFO L140 encePairwiseOnDemand]: 188/201 looper letters, 54 selfloop transitions, 18 changer transitions 0/227 dead transitions. [2025-02-08 05:29:20,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 227 transitions, 810 flow [2025-02-08 05:29:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2025-02-08 05:29:20,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117744610281924 [2025-02-08 05:29:20,717 INFO L175 Difference]: Start difference. First operand has 196 places, 226 transitions, 664 flow. Second operand 6 states and 979 transitions. [2025-02-08 05:29:20,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 227 transitions, 810 flow [2025-02-08 05:29:20,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 227 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:20,724 INFO L231 Difference]: Finished difference. Result has 202 places, 227 transitions, 734 flow [2025-02-08 05:29:20,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=202, PETRI_TRANSITIONS=227} [2025-02-08 05:29:20,725 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 11 predicate places. [2025-02-08 05:29:20,725 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 227 transitions, 734 flow [2025-02-08 05:29:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:20,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:20,726 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] [2025-02-08 05:29:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:29:20,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1850666239, now seen corresponding path program 1 times [2025-02-08 05:29:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:20,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413974453] [2025-02-08 05:29:20,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:20,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:29:20,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:29:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413974453] [2025-02-08 05:29:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413974453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787148298] [2025-02-08 05:29:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:21,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:21,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:21,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 201 [2025-02-08 05:29:21,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 227 transitions, 734 flow. Second operand has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:21,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:21,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 201 [2025-02-08 05:29:21,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:21,915 INFO L124 PetriNetUnfolderBase]: 492/2934 cut-off events. [2025-02-08 05:29:21,915 INFO L125 PetriNetUnfolderBase]: For 1621/1923 co-relation queries the response was YES. [2025-02-08 05:29:21,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5378 conditions, 2934 events. 492/2934 cut-off events. For 1621/1923 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 23302 event pairs, 40 based on Foata normal form. 92/2845 useless extension candidates. Maximal degree in co-relation 5314. Up to 624 conditions per place. [2025-02-08 05:29:21,936 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 64 selfloop transitions, 76 changer transitions 0/300 dead transitions. [2025-02-08 05:29:21,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 300 transitions, 1402 flow [2025-02-08 05:29:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-02-08 05:29:21,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8648424543946932 [2025-02-08 05:29:21,939 INFO L175 Difference]: Start difference. First operand has 202 places, 227 transitions, 734 flow. Second operand 6 states and 1043 transitions. [2025-02-08 05:29:21,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 300 transitions, 1402 flow [2025-02-08 05:29:21,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 300 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:29:21,951 INFO L231 Difference]: Finished difference. Result has 211 places, 300 transitions, 1452 flow [2025-02-08 05:29:21,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1452, PETRI_PLACES=211, PETRI_TRANSITIONS=300} [2025-02-08 05:29:21,953 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 20 predicate places. [2025-02-08 05:29:21,953 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 300 transitions, 1452 flow [2025-02-08 05:29:21,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:21,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:21,954 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] [2025-02-08 05:29:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:29:21,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -151994329, now seen corresponding path program 1 times [2025-02-08 05:29:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627887714] [2025-02-08 05:29:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:21,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:29:21,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:29:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627887714] [2025-02-08 05:29:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627887714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50585236] [2025-02-08 05:29:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:22,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:22,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:22,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:22,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:22,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2025-02-08 05:29:22,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 300 transitions, 1452 flow. Second operand has 6 states, 6 states have (on average 175.66666666666666) internal successors, (1054), 6 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:22,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:22,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2025-02-08 05:29:22,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:23,028 INFO L124 PetriNetUnfolderBase]: 374/2628 cut-off events. [2025-02-08 05:29:23,029 INFO L125 PetriNetUnfolderBase]: For 1859/1979 co-relation queries the response was YES. [2025-02-08 05:29:23,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5429 conditions, 2628 events. 374/2628 cut-off events. For 1859/1979 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 20662 event pairs, 8 based on Foata normal form. 10/2529 useless extension candidates. Maximal degree in co-relation 5360. Up to 427 conditions per place. [2025-02-08 05:29:23,049 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 56 selfloop transitions, 17 changer transitions 0/303 dead transitions. [2025-02-08 05:29:23,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 303 transitions, 1604 flow [2025-02-08 05:29:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2025-02-08 05:29:23,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822553897180763 [2025-02-08 05:29:23,052 INFO L175 Difference]: Start difference. First operand has 211 places, 300 transitions, 1452 flow. Second operand 6 states and 1064 transitions. [2025-02-08 05:29:23,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 303 transitions, 1604 flow [2025-02-08 05:29:23,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 303 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:23,066 INFO L231 Difference]: Finished difference. Result has 219 places, 303 transitions, 1520 flow [2025-02-08 05:29:23,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1520, PETRI_PLACES=219, PETRI_TRANSITIONS=303} [2025-02-08 05:29:23,068 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 28 predicate places. [2025-02-08 05:29:23,068 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 303 transitions, 1520 flow [2025-02-08 05:29:23,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.66666666666666) internal successors, (1054), 6 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:23,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:23,069 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] [2025-02-08 05:29:23,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:29:23,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1257572297, now seen corresponding path program 1 times [2025-02-08 05:29:23,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:23,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724902981] [2025-02-08 05:29:23,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:29:23,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:29:23,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:23,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:29:23,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:23,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724902981] [2025-02-08 05:29:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724902981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:23,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:23,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773908556] [2025-02-08 05:29:23,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:23,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:23,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:23,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:23,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 201 [2025-02-08 05:29:23,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 303 transitions, 1520 flow. Second operand has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:23,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:23,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 201 [2025-02-08 05:29:23,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:24,796 INFO L124 PetriNetUnfolderBase]: 1722/5609 cut-off events. [2025-02-08 05:29:24,796 INFO L125 PetriNetUnfolderBase]: For 5326/5339 co-relation queries the response was YES. [2025-02-08 05:29:24,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14985 conditions, 5609 events. 1722/5609 cut-off events. For 5326/5339 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 43450 event pairs, 720 based on Foata normal form. 5/5418 useless extension candidates. Maximal degree in co-relation 14912. Up to 3402 conditions per place. [2025-02-08 05:29:24,836 INFO L140 encePairwiseOnDemand]: 178/201 looper letters, 161 selfloop transitions, 100 changer transitions 0/390 dead transitions. [2025-02-08 05:29:24,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 390 transitions, 2472 flow [2025-02-08 05:29:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 950 transitions. [2025-02-08 05:29:24,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877280265339967 [2025-02-08 05:29:24,839 INFO L175 Difference]: Start difference. First operand has 219 places, 303 transitions, 1520 flow. Second operand 6 states and 950 transitions. [2025-02-08 05:29:24,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 390 transitions, 2472 flow [2025-02-08 05:29:24,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 390 transitions, 2458 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:29:24,872 INFO L231 Difference]: Finished difference. Result has 228 places, 390 transitions, 2416 flow [2025-02-08 05:29:24,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2416, PETRI_PLACES=228, PETRI_TRANSITIONS=390} [2025-02-08 05:29:24,873 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 37 predicate places. [2025-02-08 05:29:24,873 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 390 transitions, 2416 flow [2025-02-08 05:29:24,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:24,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:24,874 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] [2025-02-08 05:29:24,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:29:24,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1879956327, now seen corresponding path program 1 times [2025-02-08 05:29:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001422392] [2025-02-08 05:29:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:29:24,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:29:24,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:24,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001422392] [2025-02-08 05:29:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001422392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-08 05:29:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898690765] [2025-02-08 05:29:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 05:29:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 05:29:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-02-08 05:29:33,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 201 [2025-02-08 05:29:33,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 390 transitions, 2416 flow. Second operand has 24 states, 24 states have (on average 126.79166666666667) internal successors, (3043), 24 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:33,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:33,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 201 [2025-02-08 05:29:33,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:38,501 INFO L124 PetriNetUnfolderBase]: 2482/10930 cut-off events. [2025-02-08 05:29:38,502 INFO L125 PetriNetUnfolderBase]: For 12684/13241 co-relation queries the response was YES. [2025-02-08 05:29:38,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28545 conditions, 10930 events. 2482/10930 cut-off events. For 12684/13241 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 108450 event pairs, 144 based on Foata normal form. 234/10834 useless extension candidates. Maximal degree in co-relation 28458. Up to 2086 conditions per place. [2025-02-08 05:29:38,576 INFO L140 encePairwiseOnDemand]: 152/201 looper letters, 527 selfloop transitions, 147 changer transitions 36/910 dead transitions. [2025-02-08 05:29:38,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 910 transitions, 6766 flow [2025-02-08 05:29:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 05:29:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-08 05:29:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4661 transitions. [2025-02-08 05:29:38,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6820310213637694 [2025-02-08 05:29:38,588 INFO L175 Difference]: Start difference. First operand has 228 places, 390 transitions, 2416 flow. Second operand 34 states and 4661 transitions. [2025-02-08 05:29:38,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 910 transitions, 6766 flow [2025-02-08 05:29:38,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 910 transitions, 6682 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:38,721 INFO L231 Difference]: Finished difference. Result has 288 places, 546 transitions, 4165 flow [2025-02-08 05:29:38,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4165, PETRI_PLACES=288, PETRI_TRANSITIONS=546} [2025-02-08 05:29:38,724 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 97 predicate places. [2025-02-08 05:29:38,724 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 546 transitions, 4165 flow [2025-02-08 05:29:38,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 126.79166666666667) internal successors, (3043), 24 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:38,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:38,727 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] [2025-02-08 05:29:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:29:38,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:29:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1106233961, now seen corresponding path program 2 times [2025-02-08 05:29:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414589492] [2025-02-08 05:29:38,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:29:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:38,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 05:29:38,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:29:38,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:29:38,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:29:43,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:43,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414589492] [2025-02-08 05:29:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414589492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:43,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-02-08 05:29:43,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432012546] [2025-02-08 05:29:43,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 05:29:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:43,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 05:29:43,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 05:29:50,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 201 [2025-02-08 05:29:50,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 546 transitions, 4165 flow. Second operand has 33 states, 33 states have (on average 86.78787878787878) internal successors, (2864), 33 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:50,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:50,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 201 [2025-02-08 05:29:50,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:05,154 INFO L124 PetriNetUnfolderBase]: 16407/40597 cut-off events. [2025-02-08 05:30:05,154 INFO L125 PetriNetUnfolderBase]: For 118775/118930 co-relation queries the response was YES. [2025-02-08 05:30:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143934 conditions, 40597 events. 16407/40597 cut-off events. For 118775/118930 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 401386 event pairs, 2688 based on Foata normal form. 183/40187 useless extension candidates. Maximal degree in co-relation 143811. Up to 7800 conditions per place. [2025-02-08 05:30:05,612 INFO L140 encePairwiseOnDemand]: 149/201 looper letters, 2030 selfloop transitions, 317 changer transitions 72/2497 dead transitions. [2025-02-08 05:30:05,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2497 transitions, 23757 flow [2025-02-08 05:30:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-08 05:30:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-02-08 05:30:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 5962 transitions. [2025-02-08 05:30:05,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5203805533734834 [2025-02-08 05:30:05,624 INFO L175 Difference]: Start difference. First operand has 288 places, 546 transitions, 4165 flow. Second operand 57 states and 5962 transitions. [2025-02-08 05:30:05,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2497 transitions, 23757 flow [2025-02-08 05:30:06,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 2497 transitions, 23736 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 05:30:06,323 INFO L231 Difference]: Finished difference. Result has 385 places, 848 transitions, 8663 flow [2025-02-08 05:30:06,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=4152, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8663, PETRI_PLACES=385, PETRI_TRANSITIONS=848} [2025-02-08 05:30:06,325 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 194 predicate places. [2025-02-08 05:30:06,325 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 848 transitions, 8663 flow [2025-02-08 05:30:06,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 86.78787878787878) internal successors, (2864), 33 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:06,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:06,326 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] [2025-02-08 05:30:06,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:30:06,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash 164926601, now seen corresponding path program 3 times [2025-02-08 05:30:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388934315] [2025-02-08 05:30:06,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:30:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:06,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 2 equivalence classes. [2025-02-08 05:30:06,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:30:06,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:30:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:30:08,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388934315] [2025-02-08 05:30:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388934315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-08 05:30:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399286650] [2025-02-08 05:30:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 05:30:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:08,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 05:30:08,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-02-08 05:30:14,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 201 [2025-02-08 05:30:14,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 848 transitions, 8663 flow. Second operand has 26 states, 26 states have (on average 117.88461538461539) internal successors, (3065), 26 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 201 [2025-02-08 05:30:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:24,717 INFO L124 PetriNetUnfolderBase]: 7491/26088 cut-off events. [2025-02-08 05:30:24,718 INFO L125 PetriNetUnfolderBase]: For 243760/244790 co-relation queries the response was YES. [2025-02-08 05:30:24,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110469 conditions, 26088 events. 7491/26088 cut-off events. For 243760/244790 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 284961 event pairs, 260 based on Foata normal form. 370/25904 useless extension candidates. Maximal degree in co-relation 110297. Up to 3655 conditions per place. [2025-02-08 05:30:25,092 INFO L140 encePairwiseOnDemand]: 159/201 looper letters, 1206 selfloop transitions, 280 changer transitions 42/1704 dead transitions. [2025-02-08 05:30:25,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1704 transitions, 21992 flow [2025-02-08 05:30:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 05:30:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-02-08 05:30:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5943 transitions. [2025-02-08 05:30:25,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6290885995554144 [2025-02-08 05:30:25,099 INFO L175 Difference]: Start difference. First operand has 385 places, 848 transitions, 8663 flow. Second operand 47 states and 5943 transitions. [2025-02-08 05:30:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1704 transitions, 21992 flow [2025-02-08 05:30:26,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1704 transitions, 21836 flow, removed 66 selfloop flow, removed 7 redundant places. [2025-02-08 05:30:26,250 INFO L231 Difference]: Finished difference. Result has 453 places, 1033 transitions, 12069 flow [2025-02-08 05:30:26,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=8517, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=12069, PETRI_PLACES=453, PETRI_TRANSITIONS=1033} [2025-02-08 05:30:26,251 INFO L279 CegarLoopForPetriNet]: 191 programPoint places, 262 predicate places. [2025-02-08 05:30:26,252 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 1033 transitions, 12069 flow [2025-02-08 05:30:26,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 117.88461538461539) internal successors, (3065), 26 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:26,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:26,253 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] [2025-02-08 05:30:26,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:30:26,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:26,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash 708061531, now seen corresponding path program 4 times [2025-02-08 05:30:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955199875] [2025-02-08 05:30:26,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:30:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:26,269 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-02-08 05:30:26,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:30:26,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:30:26,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:30:28,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955199875] [2025-02-08 05:30:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955199875] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:30:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113800414] [2025-02-08 05:30:28,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:30:28,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:30:28,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:30:28,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:30:28,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:30:28,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-02-08 05:30:28,348 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:30:28,348 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:30:28,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:28,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 05:30:28,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:30:28,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:30:28,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 05:30:29,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:30:29,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 05:30:29,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-02-08 05:30:29,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2025-02-08 05:30:29,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2025-02-08 05:30:29,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2025-02-08 05:30:29,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:30:29,749 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-08 05:30:29,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 66 treesize of output 65 [2025-02-08 05:30:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:30:29,815 INFO L312 TraceCheckSpWp]: Computing backward predicates...