./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --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/weaver/popl20-three-array-max.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:55,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:56,026 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:40:56,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:56,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:56,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:56,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:56,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:56,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:56,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:56,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:56,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:56,052 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:56,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:56,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:56,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:56,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:56,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:56,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:56,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:56,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:56,055 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-02-08 05:40:56,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:56,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:56,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:56,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:56,268 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:56,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 05:40:57,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93d371ec7/f21b34c1cf88420e8ff6533aabc9498b/FLAG1bbc99e31 [2025-02-08 05:40:57,612 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:57,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 05:40:57,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93d371ec7/f21b34c1cf88420e8ff6533aabc9498b/FLAG1bbc99e31 [2025-02-08 05:40:57,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93d371ec7/f21b34c1cf88420e8ff6533aabc9498b [2025-02-08 05:40:57,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:57,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:57,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:57,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:57,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:57,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740d2ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57, skipping insertion in model container [2025-02-08 05:40:57,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:57,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:57,841 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:57,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:57,874 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:57,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57 WrapperNode [2025-02-08 05:40:57,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:57,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:57,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:57,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:57,881 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:40:57" (1/1) ... [2025-02-08 05:40:57,889 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:40:57" (1/1) ... [2025-02-08 05:40:57,915 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 338 [2025-02-08 05:40:57,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:57,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:57,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:57,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:57,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:57,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:57,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:57,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:57,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (1/1) ... [2025-02-08 05:40:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:57,980 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:40:57,982 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:40:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:58,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:58,003 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:40:58,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:58,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:58,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: assume #race~p~0 == #t~nondet12#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: assume !(#race~p~0 == #t~nondet12#1); [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~nondet12#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: #race~p~0 := #t~nondet12#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: havoc #t~nondet12#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: ~p~0 := 1 + ~i~1#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: havoc #t~post13#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-3: ~i~1#1 := 1 + #t~post13#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-4: #t~post13#1 := ~i~1#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc #t~nondet11#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-1: havoc #t~ret10#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-2: havoc #t~mem9#1; [2025-02-08 05:40:58,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-3: assume ((#race[~C~0.base,~C~0.offset + 4 * ~i~1#1] == #t~nondet11#1 && #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1) && #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1) && #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1; [2025-02-08 05:40:58,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-3: assume !(((#race[~C~0.base,~C~0.offset + 4 * ~i~1#1] == #t~nondet11#1 && #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1) && #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1) && #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~1#1)] == #t~nondet11#1); [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-4: havoc #t~mem8#1; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-5: #race := #race[~C~0.base,3 + (~C~0.offset + 4 * ~i~1#1) := #t~nondet11#1]; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-6: #race := #race[~C~0.base,2 + (~C~0.offset + 4 * ~i~1#1) := #t~nondet11#1]; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #race := #race[~C~0.base,1 + (~C~0.offset + 4 * ~i~1#1) := #t~nondet11#1]; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-8: #race := #race[~C~0.base,~C~0.offset + 4 * ~i~1#1 := #t~nondet11#1]; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-9: havoc #t~nondet11#1; [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-10: SUMMARY for call write~int(#t~ret10#1, ~C~0.base, ~C~0.offset + 4 * ~i~1#1, 4); srcloc: null [2025-02-08 05:40:58,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-11: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 05:40:58,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-12: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:58,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:58,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-14: #t~ret10#1 := plus_#res#1; [2025-02-08 05:40:58,671 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:58,671 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:58,799 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L133 is not an error location. [2025-02-08 05:40:58,804 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:58,804 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:58,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:58 BoogieIcfgContainer [2025-02-08 05:40:58,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:58,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:58,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:58,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:58,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:57" (1/3) ... [2025-02-08 05:40:58,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bdf32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:58, skipping insertion in model container [2025-02-08 05:40:58,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:57" (2/3) ... [2025-02-08 05:40:58,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bdf32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:58, skipping insertion in model container [2025-02-08 05:40:58,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:58" (3/3) ... [2025-02-08 05:40:58,813 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-02-08 05:40:58,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:58,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 480 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2025-02-08 05:40:58,827 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:58,915 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:58,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 489 places, 502 transitions, 1025 flow [2025-02-08 05:40:59,072 INFO L124 PetriNetUnfolderBase]: 23/499 cut-off events. [2025-02-08 05:40:59,074 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:59,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 499 events. 23/499 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 630 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 420. Up to 2 conditions per place. [2025-02-08 05:40:59,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 502 transitions, 1025 flow [2025-02-08 05:40:59,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 445 places, 455 transitions, 928 flow [2025-02-08 05:40:59,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:59,109 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;@70d8d417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:59,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-02-08 05:40:59,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:59,114 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:40:59,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:59,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:59,115 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] [2025-02-08 05:40:59,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:40:59,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2101260473, now seen corresponding path program 1 times [2025-02-08 05:40:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265546265] [2025-02-08 05:40:59,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:59,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:40:59,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:40:59,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:59,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:59,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265546265] [2025-02-08 05:40:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265546265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:59,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:59,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833202572] [2025-02-08 05:40:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:59,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:59,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:59,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:59,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 502 [2025-02-08 05:40:59,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 455 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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:40:59,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:59,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 502 [2025-02-08 05:40:59,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:59,592 INFO L124 PetriNetUnfolderBase]: 88/1163 cut-off events. [2025-02-08 05:40:59,592 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 05:40:59,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 1163 events. 88/1163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6142 event pairs, 51 based on Foata normal form. 9/964 useless extension candidates. Maximal degree in co-relation 892. Up to 123 conditions per place. [2025-02-08 05:40:59,605 INFO L140 encePairwiseOnDemand]: 475/502 looper letters, 19 selfloop transitions, 2 changer transitions 9/430 dead transitions. [2025-02-08 05:40:59,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 430 transitions, 920 flow [2025-02-08 05:40:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1399 transitions. [2025-02-08 05:40:59,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9289508632138114 [2025-02-08 05:40:59,621 INFO L175 Difference]: Start difference. First operand has 445 places, 455 transitions, 928 flow. Second operand 3 states and 1399 transitions. [2025-02-08 05:40:59,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 430 transitions, 920 flow [2025-02-08 05:40:59,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 430 transitions, 908 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:59,632 INFO L231 Difference]: Finished difference. Result has 428 places, 421 transitions, 852 flow [2025-02-08 05:40:59,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=428, PETRI_TRANSITIONS=421} [2025-02-08 05:40:59,640 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -17 predicate places. [2025-02-08 05:40:59,640 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 421 transitions, 852 flow [2025-02-08 05:40:59,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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:40:59,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:59,641 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] [2025-02-08 05:40:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:59,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:40:59,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1731657460, now seen corresponding path program 1 times [2025-02-08 05:40:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:59,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453989964] [2025-02-08 05:40:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:40:59,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:40:59,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:59,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:59,696 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:40:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453989964] [2025-02-08 05:40:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453989964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145229279] [2025-02-08 05:40:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:59,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:59,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:59,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 502 [2025-02-08 05:40:59,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 421 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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:40:59,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:59,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 502 [2025-02-08 05:40:59,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:59,905 INFO L124 PetriNetUnfolderBase]: 200/1182 cut-off events. [2025-02-08 05:40:59,905 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:40:59,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1182 events. 200/1182 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6185 event pairs, 128 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1448. Up to 277 conditions per place. [2025-02-08 05:40:59,913 INFO L140 encePairwiseOnDemand]: 494/502 looper letters, 23 selfloop transitions, 1 changer transitions 0/414 dead transitions. [2025-02-08 05:40:59,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 414 transitions, 886 flow [2025-02-08 05:40:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-08 05:40:59,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030544488711819 [2025-02-08 05:40:59,916 INFO L175 Difference]: Start difference. First operand has 428 places, 421 transitions, 852 flow. Second operand 3 states and 1360 transitions. [2025-02-08 05:40:59,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 414 transitions, 886 flow [2025-02-08 05:40:59,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 414 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:59,922 INFO L231 Difference]: Finished difference. Result has 412 places, 414 transitions, 836 flow [2025-02-08 05:40:59,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=412, PETRI_TRANSITIONS=414} [2025-02-08 05:40:59,923 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -33 predicate places. [2025-02-08 05:40:59,923 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 414 transitions, 836 flow [2025-02-08 05:40:59,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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:40:59,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:59,924 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] [2025-02-08 05:40:59,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:59,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:40:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -237518051, now seen corresponding path program 1 times [2025-02-08 05:40:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:59,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259395764] [2025-02-08 05:40:59,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:59,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:40:59,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:40:59,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:59,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259395764] [2025-02-08 05:41:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259395764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716765863] [2025-02-08 05:41:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:00,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:00,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:00,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:00,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 502 [2025-02-08 05:41:00,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 414 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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:41:00,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:00,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 502 [2025-02-08 05:41:00,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,089 INFO L124 PetriNetUnfolderBase]: 234/1325 cut-off events. [2025-02-08 05:41:01,091 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:01,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1325 events. 234/1325 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7726 event pairs, 188 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 1769. Up to 406 conditions per place. [2025-02-08 05:41:01,100 INFO L140 encePairwiseOnDemand]: 484/502 looper letters, 65 selfloop transitions, 15 changer transitions 0/411 dead transitions. [2025-02-08 05:41:01,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 411 transitions, 990 flow [2025-02-08 05:41:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2429 transitions. [2025-02-08 05:41:01,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8064409030544488 [2025-02-08 05:41:01,108 INFO L175 Difference]: Start difference. First operand has 412 places, 414 transitions, 836 flow. Second operand 6 states and 2429 transitions. [2025-02-08 05:41:01,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 411 transitions, 990 flow [2025-02-08 05:41:01,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 411 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:01,113 INFO L231 Difference]: Finished difference. Result has 413 places, 411 transitions, 859 flow [2025-02-08 05:41:01,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=413, PETRI_TRANSITIONS=411} [2025-02-08 05:41:01,114 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -32 predicate places. [2025-02-08 05:41:01,114 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 411 transitions, 859 flow [2025-02-08 05:41:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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:41:01,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,115 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] [2025-02-08 05:41:01,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:41:01,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1324964926, now seen corresponding path program 1 times [2025-02-08 05:41:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752485858] [2025-02-08 05:41:01,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:41:01,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:41:01,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:01,162 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:41:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752485858] [2025-02-08 05:41:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752485858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660403073] [2025-02-08 05:41:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:01,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:01,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:01,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 502 [2025-02-08 05:41:01,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 411 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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:41:01,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:01,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 502 [2025-02-08 05:41:01,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,247 INFO L124 PetriNetUnfolderBase]: 52/578 cut-off events. [2025-02-08 05:41:01,247 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 578 events. 52/578 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1751 event pairs, 34 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 652. Up to 77 conditions per place. [2025-02-08 05:41:01,251 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 16 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-02-08 05:41:01,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 893 flow [2025-02-08 05:41:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1381 transitions. [2025-02-08 05:41:01,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9169986719787516 [2025-02-08 05:41:01,253 INFO L175 Difference]: Start difference. First operand has 413 places, 411 transitions, 859 flow. Second operand 3 states and 1381 transitions. [2025-02-08 05:41:01,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 893 flow [2025-02-08 05:41:01,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 863 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:01,259 INFO L231 Difference]: Finished difference. Result has 409 places, 410 transitions, 831 flow [2025-02-08 05:41:01,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=409, PETRI_TRANSITIONS=410} [2025-02-08 05:41:01,260 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -36 predicate places. [2025-02-08 05:41:01,260 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 410 transitions, 831 flow [2025-02-08 05:41:01,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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:41:01,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:01,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:41:01,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash -793118329, now seen corresponding path program 1 times [2025-02-08 05:41:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934935031] [2025-02-08 05:41:01,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:41:01,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:41:01,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:01,322 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:41:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934935031] [2025-02-08 05:41:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934935031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895762502] [2025-02-08 05:41:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:01,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:01,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:01,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 502 [2025-02-08 05:41:01,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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:41:01,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:01,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 502 [2025-02-08 05:41:01,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,406 INFO L124 PetriNetUnfolderBase]: 52/577 cut-off events. [2025-02-08 05:41:01,407 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 577 events. 52/577 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1674 event pairs, 34 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 638. Up to 77 conditions per place. [2025-02-08 05:41:01,409 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 16 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2025-02-08 05:41:01,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 409 transitions, 865 flow [2025-02-08 05:41:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1381 transitions. [2025-02-08 05:41:01,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9169986719787516 [2025-02-08 05:41:01,411 INFO L175 Difference]: Start difference. First operand has 409 places, 410 transitions, 831 flow. Second operand 3 states and 1381 transitions. [2025-02-08 05:41:01,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 409 transitions, 865 flow [2025-02-08 05:41:01,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 409 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:01,415 INFO L231 Difference]: Finished difference. Result has 408 places, 409 transitions, 829 flow [2025-02-08 05:41:01,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=829, PETRI_PLACES=408, PETRI_TRANSITIONS=409} [2025-02-08 05:41:01,416 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -37 predicate places. [2025-02-08 05:41:01,416 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 409 transitions, 829 flow [2025-02-08 05:41:01,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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:41:01,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:41:01,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1248536119, now seen corresponding path program 1 times [2025-02-08 05:41:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961310140] [2025-02-08 05:41:01,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:41:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:41:01,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:01,459 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:41:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961310140] [2025-02-08 05:41:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961310140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26702491] [2025-02-08 05:41:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:01,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:01,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:01,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:01,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 502 [2025-02-08 05:41:01,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 409 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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:41:01,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:01,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 502 [2025-02-08 05:41:01,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,519 INFO L124 PetriNetUnfolderBase]: 22/446 cut-off events. [2025-02-08 05:41:01,520 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:01,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 446 events. 22/446 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 749 event pairs, 12 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 459. Up to 35 conditions per place. [2025-02-08 05:41:01,522 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 12 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-02-08 05:41:01,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 408 transitions, 855 flow [2025-02-08 05:41:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1389 transitions. [2025-02-08 05:41:01,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223107569721115 [2025-02-08 05:41:01,524 INFO L175 Difference]: Start difference. First operand has 408 places, 409 transitions, 829 flow. Second operand 3 states and 1389 transitions. [2025-02-08 05:41:01,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 408 transitions, 855 flow [2025-02-08 05:41:01,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 408 transitions, 851 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:01,531 INFO L231 Difference]: Finished difference. Result has 407 places, 408 transitions, 827 flow [2025-02-08 05:41:01,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=407, PETRI_TRANSITIONS=408} [2025-02-08 05:41:01,532 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -38 predicate places. [2025-02-08 05:41:01,533 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 408 transitions, 827 flow [2025-02-08 05:41:01,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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:41:01,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:01,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:41:01,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash -388313652, now seen corresponding path program 1 times [2025-02-08 05:41:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109895827] [2025-02-08 05:41:01,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:41:01,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:41:01,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:01,580 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:41:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109895827] [2025-02-08 05:41:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109895827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:01,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400841174] [2025-02-08 05:41:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:01,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:01,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:01,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:01,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 502 [2025-02-08 05:41:01,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 408 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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:41:01,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:01,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 502 [2025-02-08 05:41:01,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,641 INFO L124 PetriNetUnfolderBase]: 22/445 cut-off events. [2025-02-08 05:41:01,641 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:01,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 445 events. 22/445 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 746 event pairs, 12 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 458. Up to 35 conditions per place. [2025-02-08 05:41:01,643 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 12 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2025-02-08 05:41:01,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 407 transitions, 853 flow [2025-02-08 05:41:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1389 transitions. [2025-02-08 05:41:01,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223107569721115 [2025-02-08 05:41:01,646 INFO L175 Difference]: Start difference. First operand has 407 places, 408 transitions, 827 flow. Second operand 3 states and 1389 transitions. [2025-02-08 05:41:01,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 407 transitions, 853 flow [2025-02-08 05:41:01,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 849 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:01,650 INFO L231 Difference]: Finished difference. Result has 406 places, 407 transitions, 825 flow [2025-02-08 05:41:01,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=406, PETRI_TRANSITIONS=407} [2025-02-08 05:41:01,652 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -39 predicate places. [2025-02-08 05:41:01,652 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 407 transitions, 825 flow [2025-02-08 05:41:01,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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:41:01,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:41:01,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1904370756, now seen corresponding path program 1 times [2025-02-08 05:41:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644807984] [2025-02-08 05:41:01,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:41:01,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:41:01,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:01,696 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:41:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644807984] [2025-02-08 05:41:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644807984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888264588] [2025-02-08 05:41:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:01,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:01,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:01,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:01,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 502 [2025-02-08 05:41:01,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 407 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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:41:01,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:01,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 502 [2025-02-08 05:41:01,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:01,819 INFO L124 PetriNetUnfolderBase]: 107/1158 cut-off events. [2025-02-08 05:41:01,819 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2025-02-08 05:41:01,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 1158 events. 107/1158 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5594 event pairs, 56 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1284. Up to 135 conditions per place. [2025-02-08 05:41:01,824 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 17 selfloop transitions, 1 changer transitions 0/403 dead transitions. [2025-02-08 05:41:01,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 403 transitions, 853 flow [2025-02-08 05:41:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-02-08 05:41:01,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9150066401062417 [2025-02-08 05:41:01,827 INFO L175 Difference]: Start difference. First operand has 406 places, 407 transitions, 825 flow. Second operand 3 states and 1378 transitions. [2025-02-08 05:41:01,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 403 transitions, 853 flow [2025-02-08 05:41:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 403 transitions, 849 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:01,831 INFO L231 Difference]: Finished difference. Result has 402 places, 403 transitions, 815 flow [2025-02-08 05:41:01,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=815, PETRI_PLACES=402, PETRI_TRANSITIONS=403} [2025-02-08 05:41:01,832 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -43 predicate places. [2025-02-08 05:41:01,832 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 403 transitions, 815 flow [2025-02-08 05:41:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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:41:01,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:01,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:41:01,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 443609870, now seen corresponding path program 1 times [2025-02-08 05:41:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843563775] [2025-02-08 05:41:01,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:01,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:41:01,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:41:01,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:01,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:02,190 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:41:02,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843563775] [2025-02-08 05:41:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843563775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:02,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:02,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402841371] [2025-02-08 05:41:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:02,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:02,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:02,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:02,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 502 [2025-02-08 05:41:02,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 403 transitions, 815 flow. Second operand has 6 states, 6 states have (on average 440.1666666666667) internal successors, (2641), 6 states have internal predecessors, (2641), 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:41:02,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:02,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 502 [2025-02-08 05:41:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:02,619 INFO L124 PetriNetUnfolderBase]: 22/439 cut-off events. [2025-02-08 05:41:02,620 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:02,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 439 events. 22/439 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 727 event pairs, 12 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 470. Up to 38 conditions per place. [2025-02-08 05:41:02,622 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 29 selfloop transitions, 4 changer transitions 0/401 dead transitions. [2025-02-08 05:41:02,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 877 flow [2025-02-08 05:41:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2669 transitions. [2025-02-08 05:41:02,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861221779548473 [2025-02-08 05:41:02,626 INFO L175 Difference]: Start difference. First operand has 402 places, 403 transitions, 815 flow. Second operand 6 states and 2669 transitions. [2025-02-08 05:41:02,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 877 flow [2025-02-08 05:41:02,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 401 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:02,631 INFO L231 Difference]: Finished difference. Result has 404 places, 401 transitions, 818 flow [2025-02-08 05:41:02,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=818, PETRI_PLACES=404, PETRI_TRANSITIONS=401} [2025-02-08 05:41:02,632 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -41 predicate places. [2025-02-08 05:41:02,632 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 401 transitions, 818 flow [2025-02-08 05:41:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 440.1666666666667) internal successors, (2641), 6 states have internal predecessors, (2641), 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:41:02,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:02,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:02,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:41:02,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:02,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash -979504869, now seen corresponding path program 1 times [2025-02-08 05:41:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602504470] [2025-02-08 05:41:02,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:41:02,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:41:02,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:02,678 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:41:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602504470] [2025-02-08 05:41:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602504470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063254513] [2025-02-08 05:41:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:02,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:02,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:02,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:02,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 502 [2025-02-08 05:41:02,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 401 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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:41:02,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:02,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 502 [2025-02-08 05:41:02,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:02,757 INFO L124 PetriNetUnfolderBase]: 52/568 cut-off events. [2025-02-08 05:41:02,757 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:02,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 568 events. 52/568 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1597 event pairs, 34 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 631. Up to 76 conditions per place. [2025-02-08 05:41:02,760 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 15 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-02-08 05:41:02,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 400 transitions, 850 flow [2025-02-08 05:41:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1383 transitions. [2025-02-08 05:41:02,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9183266932270916 [2025-02-08 05:41:02,763 INFO L175 Difference]: Start difference. First operand has 404 places, 401 transitions, 818 flow. Second operand 3 states and 1383 transitions. [2025-02-08 05:41:02,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 400 transitions, 850 flow [2025-02-08 05:41:02,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 400 transitions, 843 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:41:02,767 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 813 flow [2025-02-08 05:41:02,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2025-02-08 05:41:02,768 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -44 predicate places. [2025-02-08 05:41:02,768 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 813 flow [2025-02-08 05:41:02,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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:41:02,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:02,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:02,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:41:02,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:02,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -159013144, now seen corresponding path program 1 times [2025-02-08 05:41:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020587912] [2025-02-08 05:41:02,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:02,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:41:02,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:41:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:02,807 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:41:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020587912] [2025-02-08 05:41:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020587912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:02,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:02,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333645083] [2025-02-08 05:41:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:02,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:02,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:02,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 502 [2025-02-08 05:41:02,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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:41:02,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:02,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 502 [2025-02-08 05:41:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:02,920 INFO L124 PetriNetUnfolderBase]: 100/1130 cut-off events. [2025-02-08 05:41:02,921 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 1130 events. 100/1130 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5524 event pairs, 56 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 1252. Up to 129 conditions per place. [2025-02-08 05:41:02,926 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 17 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2025-02-08 05:41:02,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 841 flow [2025-02-08 05:41:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-02-08 05:41:02,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9150066401062417 [2025-02-08 05:41:02,929 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 813 flow. Second operand 3 states and 1378 transitions. [2025-02-08 05:41:02,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 841 flow [2025-02-08 05:41:02,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:02,933 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 803 flow [2025-02-08 05:41:02,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-02-08 05:41:02,934 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -48 predicate places. [2025-02-08 05:41:02,934 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 803 flow [2025-02-08 05:41:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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:41:02,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:02,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:02,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:41:02,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -528570671, now seen corresponding path program 1 times [2025-02-08 05:41:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700567600] [2025-02-08 05:41:02,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:02,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:41:02,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:41:02,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:02,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:03,283 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:41:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700567600] [2025-02-08 05:41:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700567600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916029593] [2025-02-08 05:41:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:03,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:03,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:03,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:03,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 502 [2025-02-08 05:41:03,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 803 flow. Second operand has 6 states, 6 states have (on average 440.1666666666667) internal successors, (2641), 6 states have internal predecessors, (2641), 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:41:03,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:03,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 502 [2025-02-08 05:41:03,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:03,700 INFO L124 PetriNetUnfolderBase]: 22/432 cut-off events. [2025-02-08 05:41:03,700 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:03,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 432 events. 22/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 705 event pairs, 12 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 465. Up to 38 conditions per place. [2025-02-08 05:41:03,702 INFO L140 encePairwiseOnDemand]: 496/502 looper letters, 29 selfloop transitions, 4 changer transitions 0/394 dead transitions. [2025-02-08 05:41:03,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 394 transitions, 865 flow [2025-02-08 05:41:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2669 transitions. [2025-02-08 05:41:03,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861221779548473 [2025-02-08 05:41:03,707 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 803 flow. Second operand 6 states and 2669 transitions. [2025-02-08 05:41:03,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 394 transitions, 865 flow [2025-02-08 05:41:03,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 394 transitions, 864 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:03,713 INFO L231 Difference]: Finished difference. Result has 399 places, 394 transitions, 806 flow [2025-02-08 05:41:03,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=806, PETRI_PLACES=399, PETRI_TRANSITIONS=394} [2025-02-08 05:41:03,716 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -46 predicate places. [2025-02-08 05:41:03,716 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 394 transitions, 806 flow [2025-02-08 05:41:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 440.1666666666667) internal successors, (2641), 6 states have internal predecessors, (2641), 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:41:03,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:03,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:41:03,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:03,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1585561091, now seen corresponding path program 1 times [2025-02-08 05:41:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123020859] [2025-02-08 05:41:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:03,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:41:03,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:41:03,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:03,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:03,773 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:41:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123020859] [2025-02-08 05:41:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123020859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836516826] [2025-02-08 05:41:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:03,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 502 [2025-02-08 05:41:03,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 394 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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:41:03,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:03,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 502 [2025-02-08 05:41:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:03,850 INFO L124 PetriNetUnfolderBase]: 52/561 cut-off events. [2025-02-08 05:41:03,851 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 561 events. 52/561 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1594 event pairs, 34 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 626. Up to 76 conditions per place. [2025-02-08 05:41:03,854 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2025-02-08 05:41:03,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 393 transitions, 838 flow [2025-02-08 05:41:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1383 transitions. [2025-02-08 05:41:03,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9183266932270916 [2025-02-08 05:41:03,857 INFO L175 Difference]: Start difference. First operand has 399 places, 394 transitions, 806 flow. Second operand 3 states and 1383 transitions. [2025-02-08 05:41:03,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 393 transitions, 838 flow [2025-02-08 05:41:03,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 393 transitions, 831 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:41:03,862 INFO L231 Difference]: Finished difference. Result has 396 places, 393 transitions, 801 flow [2025-02-08 05:41:03,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=396, PETRI_TRANSITIONS=393} [2025-02-08 05:41:03,863 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -49 predicate places. [2025-02-08 05:41:03,863 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 393 transitions, 801 flow [2025-02-08 05:41:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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:41:03,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:03,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:03,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:41:03,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1974359026, now seen corresponding path program 1 times [2025-02-08 05:41:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749101928] [2025-02-08 05:41:03,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:41:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:41:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:03,921 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:41:03,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749101928] [2025-02-08 05:41:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749101928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952199290] [2025-02-08 05:41:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:03,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:03,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:03,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:03,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 502 [2025-02-08 05:41:03,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 393 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:41:03,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:03,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 502 [2025-02-08 05:41:03,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:03,990 INFO L124 PetriNetUnfolderBase]: 22/430 cut-off events. [2025-02-08 05:41:03,990 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:03,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 430 events. 22/430 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 703 event pairs, 12 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 448. Up to 36 conditions per place. [2025-02-08 05:41:03,993 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2025-02-08 05:41:03,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 392 transitions, 829 flow [2025-02-08 05:41:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-02-08 05:41:03,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9209827357237715 [2025-02-08 05:41:03,996 INFO L175 Difference]: Start difference. First operand has 396 places, 393 transitions, 801 flow. Second operand 3 states and 1387 transitions. [2025-02-08 05:41:03,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 392 transitions, 829 flow [2025-02-08 05:41:03,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 392 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:04,000 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 799 flow [2025-02-08 05:41:04,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2025-02-08 05:41:04,001 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -50 predicate places. [2025-02-08 05:41:04,001 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 799 flow [2025-02-08 05:41:04,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:41:04,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:04,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:04,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:41:04,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 252745289, now seen corresponding path program 1 times [2025-02-08 05:41:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335434338] [2025-02-08 05:41:04,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 05:41:04,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 05:41:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:04,070 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:41:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335434338] [2025-02-08 05:41:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335434338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594845553] [2025-02-08 05:41:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:04,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:04,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:04,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:04,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 502 [2025-02-08 05:41:04,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:41:04,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:04,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 502 [2025-02-08 05:41:04,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:04,201 INFO L124 PetriNetUnfolderBase]: 86/1133 cut-off events. [2025-02-08 05:41:04,202 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:04,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1133 events. 86/1133 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6125 event pairs, 23 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1247. Up to 71 conditions per place. [2025-02-08 05:41:04,208 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 22 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2025-02-08 05:41:04,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 400 transitions, 870 flow [2025-02-08 05:41:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-02-08 05:41:04,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9282868525896414 [2025-02-08 05:41:04,211 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 799 flow. Second operand 3 states and 1398 transitions. [2025-02-08 05:41:04,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 400 transitions, 870 flow [2025-02-08 05:41:04,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 400 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:04,217 INFO L231 Difference]: Finished difference. Result has 394 places, 392 transitions, 808 flow [2025-02-08 05:41:04,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=394, PETRI_TRANSITIONS=392} [2025-02-08 05:41:04,218 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -51 predicate places. [2025-02-08 05:41:04,219 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 392 transitions, 808 flow [2025-02-08 05:41:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:41:04,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:04,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:04,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:41:04,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:04,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1420440877, now seen corresponding path program 1 times [2025-02-08 05:41:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922718989] [2025-02-08 05:41:04,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:04,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-08 05:41:04,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-08 05:41:04,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:04,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:04,429 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:41:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922718989] [2025-02-08 05:41:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922718989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:41:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684046749] [2025-02-08 05:41:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:41:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:04,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:41:04,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:41:04,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 502 [2025-02-08 05:41:04,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 392 transitions, 808 flow. Second operand has 7 states, 7 states have (on average 436.14285714285717) internal successors, (3053), 7 states have internal predecessors, (3053), 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:41:04,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:04,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 502 [2025-02-08 05:41:04,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:05,061 INFO L124 PetriNetUnfolderBase]: 196/1772 cut-off events. [2025-02-08 05:41:05,061 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 05:41:05,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 1772 events. 196/1772 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9084 event pairs, 116 based on Foata normal form. 9/1643 useless extension candidates. Maximal degree in co-relation 2137. Up to 195 conditions per place. [2025-02-08 05:41:05,070 INFO L140 encePairwiseOnDemand]: 473/502 looper letters, 49 selfloop transitions, 42 changer transitions 0/441 dead transitions. [2025-02-08 05:41:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 441 transitions, 1096 flow [2025-02-08 05:41:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:41:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:41:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4412 transitions. [2025-02-08 05:41:05,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8788844621513944 [2025-02-08 05:41:05,077 INFO L175 Difference]: Start difference. First operand has 394 places, 392 transitions, 808 flow. Second operand 10 states and 4412 transitions. [2025-02-08 05:41:05,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 441 transitions, 1096 flow [2025-02-08 05:41:05,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 441 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:05,082 INFO L231 Difference]: Finished difference. Result has 406 places, 417 transitions, 997 flow [2025-02-08 05:41:05,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=997, PETRI_PLACES=406, PETRI_TRANSITIONS=417} [2025-02-08 05:41:05,083 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -39 predicate places. [2025-02-08 05:41:05,083 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 417 transitions, 997 flow [2025-02-08 05:41:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 436.14285714285717) internal successors, (3053), 7 states have internal predecessors, (3053), 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:41:05,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:05,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:41:05,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1489445363, now seen corresponding path program 1 times [2025-02-08 05:41:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776995253] [2025-02-08 05:41:05,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:05,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:41:05,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:41:05,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:05,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:05,144 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:41:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776995253] [2025-02-08 05:41:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776995253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991093565] [2025-02-08 05:41:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:05,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:05,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:05,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 502 [2025-02-08 05:41:05,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 417 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 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:41:05,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:05,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 502 [2025-02-08 05:41:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:05,249 INFO L124 PetriNetUnfolderBase]: 61/884 cut-off events. [2025-02-08 05:41:05,249 INFO L125 PetriNetUnfolderBase]: For 32/44 co-relation queries the response was YES. [2025-02-08 05:41:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 884 events. 61/884 cut-off events. For 32/44 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2314 event pairs, 33 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1052. Up to 88 conditions per place. [2025-02-08 05:41:05,252 INFO L140 encePairwiseOnDemand]: 500/502 looper letters, 11 selfloop transitions, 1 changer transitions 0/416 dead transitions. [2025-02-08 05:41:05,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 1019 flow [2025-02-08 05:41:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-02-08 05:41:05,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9269588313413014 [2025-02-08 05:41:05,255 INFO L175 Difference]: Start difference. First operand has 406 places, 417 transitions, 997 flow. Second operand 3 states and 1396 transitions. [2025-02-08 05:41:05,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 1019 flow [2025-02-08 05:41:05,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 1019 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:05,260 INFO L231 Difference]: Finished difference. Result has 407 places, 416 transitions, 997 flow [2025-02-08 05:41:05,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=997, PETRI_PLACES=407, PETRI_TRANSITIONS=416} [2025-02-08 05:41:05,261 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -38 predicate places. [2025-02-08 05:41:05,261 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 416 transitions, 997 flow [2025-02-08 05:41:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 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:41:05,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:05,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:41:05,262 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 619349068, now seen corresponding path program 1 times [2025-02-08 05:41:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879530608] [2025-02-08 05:41:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:05,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-08 05:41:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-08 05:41:05,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:05,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:05,315 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:41:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879530608] [2025-02-08 05:41:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879530608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054879401] [2025-02-08 05:41:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:05,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:05,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:05,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 502 [2025-02-08 05:41:05,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 416 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 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:41:05,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:05,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 502 [2025-02-08 05:41:05,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:05,601 INFO L124 PetriNetUnfolderBase]: 178/1989 cut-off events. [2025-02-08 05:41:05,601 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:41:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1989 events. 178/1989 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11934 event pairs, 55 based on Foata normal form. 2/1862 useless extension candidates. Maximal degree in co-relation 2417. Up to 139 conditions per place. [2025-02-08 05:41:05,608 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 18 selfloop transitions, 2 changer transitions 31/424 dead transitions. [2025-02-08 05:41:05,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 424 transitions, 1066 flow [2025-02-08 05:41:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-02-08 05:41:05,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276228419654714 [2025-02-08 05:41:05,611 INFO L175 Difference]: Start difference. First operand has 407 places, 416 transitions, 997 flow. Second operand 3 states and 1397 transitions. [2025-02-08 05:41:05,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 424 transitions, 1066 flow [2025-02-08 05:41:05,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 424 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:05,616 INFO L231 Difference]: Finished difference. Result has 407 places, 386 transitions, 872 flow [2025-02-08 05:41:05,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=407, PETRI_TRANSITIONS=386} [2025-02-08 05:41:05,617 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -38 predicate places. [2025-02-08 05:41:05,617 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 386 transitions, 872 flow [2025-02-08 05:41:05,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 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:41:05,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:05,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:41:05,618 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 75448659, now seen corresponding path program 1 times [2025-02-08 05:41:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291456561] [2025-02-08 05:41:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:05,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-08 05:41:05,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-08 05:41:05,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:05,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:41:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291456561] [2025-02-08 05:41:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291456561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:41:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108416957] [2025-02-08 05:41:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:41:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:41:05,864 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:41:05,866 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:41:05,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-08 05:41:06,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-08 05:41:06,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:06,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:41:06,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:41:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:41:06,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:41:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:41:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108416957] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:41:06,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:41:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-08 05:41:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740636147] [2025-02-08 05:41:06,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:41:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 05:41:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:06,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 05:41:06,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:41:07,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 502 [2025-02-08 05:41:07,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 386 transitions, 872 flow. Second operand has 19 states, 19 states have (on average 425.1578947368421) internal successors, (8078), 19 states have internal predecessors, (8078), 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:41:07,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:07,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 502 [2025-02-08 05:41:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:08,628 INFO L124 PetriNetUnfolderBase]: 354/2445 cut-off events. [2025-02-08 05:41:08,628 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-02-08 05:41:08,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 2445 events. 354/2445 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 14543 event pairs, 211 based on Foata normal form. 9/2281 useless extension candidates. Maximal degree in co-relation 3368. Up to 349 conditions per place. [2025-02-08 05:41:08,648 INFO L140 encePairwiseOnDemand]: 463/502 looper letters, 40 selfloop transitions, 37 changer transitions 64/473 dead transitions. [2025-02-08 05:41:08,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 473 transitions, 1423 flow [2025-02-08 05:41:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:41:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:41:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8160 transitions. [2025-02-08 05:41:08,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855525267351646 [2025-02-08 05:41:08,659 INFO L175 Difference]: Start difference. First operand has 407 places, 386 transitions, 872 flow. Second operand 19 states and 8160 transitions. [2025-02-08 05:41:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 473 transitions, 1423 flow [2025-02-08 05:41:08,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 473 transitions, 1319 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-02-08 05:41:08,667 INFO L231 Difference]: Finished difference. Result has 416 places, 398 transitions, 1006 flow [2025-02-08 05:41:08,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1006, PETRI_PLACES=416, PETRI_TRANSITIONS=398} [2025-02-08 05:41:08,667 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -29 predicate places. [2025-02-08 05:41:08,667 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 398 transitions, 1006 flow [2025-02-08 05:41:08,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 425.1578947368421) internal successors, (8078), 19 states have internal predecessors, (8078), 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:41:08,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:08,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:41:08,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:41:08,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:08,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -187699027, now seen corresponding path program 2 times [2025-02-08 05:41:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520844501] [2025-02-08 05:41:08,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:41:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:08,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-02-08 05:41:08,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 219 of 325 statements. [2025-02-08 05:41:08,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:41:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 05:41:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:09,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520844501] [2025-02-08 05:41:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520844501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318872630] [2025-02-08 05:41:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:09,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:09,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:09,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:09,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 502 [2025-02-08 05:41:09,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 398 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 439.5) internal successors, (2637), 6 states have internal predecessors, (2637), 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:41:09,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:09,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 502 [2025-02-08 05:41:09,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:09,965 INFO L124 PetriNetUnfolderBase]: 419/2315 cut-off events. [2025-02-08 05:41:09,965 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-02-08 05:41:09,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 2315 events. 419/2315 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16134 event pairs, 138 based on Foata normal form. 0/2174 useless extension candidates. Maximal degree in co-relation 3369. Up to 303 conditions per place. [2025-02-08 05:41:09,979 INFO L140 encePairwiseOnDemand]: 495/502 looper letters, 50 selfloop transitions, 5 changer transitions 0/416 dead transitions. [2025-02-08 05:41:09,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 1160 flow [2025-02-08 05:41:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2673 transitions. [2025-02-08 05:41:09,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874501992031872 [2025-02-08 05:41:09,983 INFO L175 Difference]: Start difference. First operand has 416 places, 398 transitions, 1006 flow. Second operand 6 states and 2673 transitions. [2025-02-08 05:41:09,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 1160 flow [2025-02-08 05:41:09,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 416 transitions, 1092 flow, removed 17 selfloop flow, removed 11 redundant places. [2025-02-08 05:41:09,988 INFO L231 Difference]: Finished difference. Result has 400 places, 396 transitions, 944 flow [2025-02-08 05:41:09,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=400, PETRI_TRANSITIONS=396} [2025-02-08 05:41:09,988 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -45 predicate places. [2025-02-08 05:41:09,989 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 396 transitions, 944 flow [2025-02-08 05:41:09,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.5) internal successors, (2637), 6 states have internal predecessors, (2637), 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:41:09,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:09,990 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:41:09,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:09,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1532464379, now seen corresponding path program 1 times [2025-02-08 05:41:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056024406] [2025-02-08 05:41:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-08 05:41:10,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-08 05:41:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 05:41:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:10,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056024406] [2025-02-08 05:41:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056024406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:10,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585754721] [2025-02-08 05:41:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:10,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:10,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:10,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:10,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 502 [2025-02-08 05:41:10,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 396 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 439.5) internal successors, (2637), 6 states have internal predecessors, (2637), 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:41:10,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:10,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 502 [2025-02-08 05:41:10,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:11,230 INFO L124 PetriNetUnfolderBase]: 413/2099 cut-off events. [2025-02-08 05:41:11,230 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-08 05:41:11,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 2099 events. 413/2099 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 13810 event pairs, 138 based on Foata normal form. 0/1978 useless extension candidates. Maximal degree in co-relation 3095. Up to 303 conditions per place. [2025-02-08 05:41:11,237 INFO L140 encePairwiseOnDemand]: 495/502 looper letters, 50 selfloop transitions, 5 changer transitions 0/414 dead transitions. [2025-02-08 05:41:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 414 transitions, 1098 flow [2025-02-08 05:41:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2673 transitions. [2025-02-08 05:41:11,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874501992031872 [2025-02-08 05:41:11,241 INFO L175 Difference]: Start difference. First operand has 400 places, 396 transitions, 944 flow. Second operand 6 states and 2673 transitions. [2025-02-08 05:41:11,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 414 transitions, 1098 flow [2025-02-08 05:41:11,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 414 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:11,246 INFO L231 Difference]: Finished difference. Result has 398 places, 394 transitions, 940 flow [2025-02-08 05:41:11,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=398, PETRI_TRANSITIONS=394} [2025-02-08 05:41:11,246 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -47 predicate places. [2025-02-08 05:41:11,247 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 394 transitions, 940 flow [2025-02-08 05:41:11,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.5) internal successors, (2637), 6 states have internal predecessors, (2637), 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:41:11,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:11,248 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:41:11,248 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:11,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:11,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1163514372, now seen corresponding path program 1 times [2025-02-08 05:41:11,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:11,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814795463] [2025-02-08 05:41:11,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:11,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-08 05:41:11,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-08 05:41:11,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:11,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 05:41:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814795463] [2025-02-08 05:41:11,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814795463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:11,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:11,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280279440] [2025-02-08 05:41:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:11,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:11,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:11,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 502 [2025-02-08 05:41:11,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 394 transitions, 940 flow. Second operand has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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:41:11,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:11,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 502 [2025-02-08 05:41:11,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:11,488 INFO L124 PetriNetUnfolderBase]: 225/1520 cut-off events. [2025-02-08 05:41:11,488 INFO L125 PetriNetUnfolderBase]: For 112/136 co-relation queries the response was YES. [2025-02-08 05:41:11,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1520 events. 225/1520 cut-off events. For 112/136 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8516 event pairs, 105 based on Foata normal form. 0/1391 useless extension candidates. Maximal degree in co-relation 2071. Up to 244 conditions per place. [2025-02-08 05:41:11,496 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 18 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2025-02-08 05:41:11,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 398 transitions, 990 flow [2025-02-08 05:41:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1391 transitions. [2025-02-08 05:41:11,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236387782204515 [2025-02-08 05:41:11,498 INFO L175 Difference]: Start difference. First operand has 398 places, 394 transitions, 940 flow. Second operand 3 states and 1391 transitions. [2025-02-08 05:41:11,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 398 transitions, 990 flow [2025-02-08 05:41:11,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 398 transitions, 980 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:11,503 INFO L231 Difference]: Finished difference. Result has 394 places, 393 transitions, 932 flow [2025-02-08 05:41:11,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=394, PETRI_TRANSITIONS=393} [2025-02-08 05:41:11,504 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -51 predicate places. [2025-02-08 05:41:11,504 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 393 transitions, 932 flow [2025-02-08 05:41:11,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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:41:11,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:11,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:41:11,505 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-08 05:41:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1606989032, now seen corresponding path program 1 times [2025-02-08 05:41:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084168280] [2025-02-08 05:41:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-02-08 05:41:11,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-02-08 05:41:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-08 05:41:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084168280] [2025-02-08 05:41:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084168280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:11,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345041946] [2025-02-08 05:41:11,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:11,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:11,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:11,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 502 [2025-02-08 05:41:11,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 393 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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:41:11,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:11,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 502 [2025-02-08 05:41:11,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:11,750 INFO L124 PetriNetUnfolderBase]: 233/1518 cut-off events. [2025-02-08 05:41:11,750 INFO L125 PetriNetUnfolderBase]: For 130/150 co-relation queries the response was YES. [2025-02-08 05:41:11,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1518 events. 233/1518 cut-off events. For 130/150 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8255 event pairs, 105 based on Foata normal form. 0/1392 useless extension candidates. Maximal degree in co-relation 2045. Up to 252 conditions per place. [2025-02-08 05:41:11,755 INFO L140 encePairwiseOnDemand]: 499/502 looper letters, 0 selfloop transitions, 0 changer transitions 397/397 dead transitions. [2025-02-08 05:41:11,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 397 transitions, 982 flow [2025-02-08 05:41:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1391 transitions. [2025-02-08 05:41:11,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236387782204515 [2025-02-08 05:41:11,757 INFO L175 Difference]: Start difference. First operand has 394 places, 393 transitions, 932 flow. Second operand 3 states and 1391 transitions. [2025-02-08 05:41:11,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 397 transitions, 982 flow [2025-02-08 05:41:11,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 397 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:11,760 INFO L231 Difference]: Finished difference. Result has 393 places, 0 transitions, 0 flow [2025-02-08 05:41:11,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=393, PETRI_TRANSITIONS=0} [2025-02-08 05:41:11,760 INFO L279 CegarLoopForPetriNet]: 445 programPoint places, -52 predicate places. [2025-02-08 05:41:11,761 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 0 transitions, 0 flow [2025-02-08 05:41:11,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-02-08 05:41:11,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-02-08 05:41:11,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 83 remaining) [2025-02-08 05:41:11,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-02-08 05:41:11,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-02-08 05:41:11,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-02-08 05:41:11,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:41:11,768 INFO L422 BasicCegarLoop]: Path program histogram: [2, 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:41:11,771 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:41:11,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:41:11,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:41:11 BasicIcfg [2025-02-08 05:41:11,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:41:11,779 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:41:11,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:41:11,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:41:11,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:58" (3/4) ... [2025-02-08 05:41:11,781 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:41:11,783 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:41:11,783 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:41:11,783 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:41:11,788 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-02-08 05:41:11,788 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 05:41:11,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:41:11,789 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:41:11,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:41:11,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:41:11,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:41:11,873 INFO L158 Benchmark]: Toolchain (without parser) took 14204.36ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 105.1MB in the beginning and 384.2MB in the end (delta: -279.2MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2025-02-08 05:41:11,874 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:11,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.24ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:11,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:11,876 INFO L158 Benchmark]: Boogie Preprocessor took 36.01ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:11,876 INFO L158 Benchmark]: IcfgBuilder took 852.85ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 88.3MB in the end (delta: -2.4MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-02-08 05:41:11,876 INFO L158 Benchmark]: TraceAbstraction took 12972.17ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 87.6MB in the beginning and 392.6MB in the end (delta: -305.1MB). Peak memory consumption was 296.3MB. Max. memory is 16.1GB. [2025-02-08 05:41:11,876 INFO L158 Benchmark]: Witness Printer took 93.04ms. Allocated memory is still 528.5MB. Free memory was 392.6MB in the beginning and 384.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:11,877 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.24ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 87.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.01ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 852.85ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 88.3MB in the end (delta: -2.4MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12972.17ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 87.6MB in the beginning and 392.6MB in the end (delta: -305.1MB). Peak memory consumption was 296.3MB. Max. memory is 16.1GB. * Witness Printer took 93.04ms. Allocated memory is still 528.5MB. Free memory was 392.6MB in the beginning and 384.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 602 locations, 83 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3501 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2530 mSDsluCounter, 2944 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2773 mSDsCounter, 677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6142 IncrementalHoareTripleChecker+Invalid, 6819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 677 mSolverCounterUnsat, 171 mSDtfsCounter, 6142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 577 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=19, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4617 NumberOfCodeBlocks, 4511 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4872 ConstructedInterpolants, 0 QuantifiedInterpolants, 7513 SizeOfPredicates, 7 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 222/225 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 55 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:41:11,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE