./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/25_stack-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4272d82e4e32dc4af1661c2cd99f5af7e9487f266698e80f4586c30581d39fa9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:00,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:00,482 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:11:00,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:00,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:00,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:00,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:00,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:00,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:00,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:00,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:00,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:00,518 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:00,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:00,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:00,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:00,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:00,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:00,521 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 -> 4272d82e4e32dc4af1661c2cd99f5af7e9487f266698e80f4586c30581d39fa9 [2025-02-08 05:11:00,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:00,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:00,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:00,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:00,835 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:00,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack-race.i [2025-02-08 05:11:02,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c083a757b/60b13379e00943a3ae5c2dc52c275de2/FLAGd4f918b32 [2025-02-08 05:11:02,580 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:02,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack-race.i [2025-02-08 05:11:02,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c083a757b/60b13379e00943a3ae5c2dc52c275de2/FLAGd4f918b32 [2025-02-08 05:11:02,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c083a757b/60b13379e00943a3ae5c2dc52c275de2 [2025-02-08 05:11:02,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:02,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:02,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:02,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:02,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:02,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:02" (1/1) ... [2025-02-08 05:11:02,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6332adaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:02, skipping insertion in model container [2025-02-08 05:11:02,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:02" (1/1) ... [2025-02-08 05:11:02,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:03,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:03,172 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:03,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:03,265 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:03,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03 WrapperNode [2025-02-08 05:11:03,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:03,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:03,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:03,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:03,272 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:11:03" (1/1) ... [2025-02-08 05:11:03,285 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:11:03" (1/1) ... [2025-02-08 05:11:03,322 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 352 [2025-02-08 05:11:03,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:03,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:03,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:03,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:03,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:03,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:03,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:03,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:03,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (1/1) ... [2025-02-08 05:11:03,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:03,400 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:11:03,403 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:11:03,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:03,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:03,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:03,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:03,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:03,425 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:11:03,543 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:03,544 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:04,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-8: __VERIFIER_atomic_assert_#t~short14#1 := 0 == __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:04,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret13#1 && __VERIFIER_atomic_assert_#t~ret13#1 <= 2147483647; [2025-02-08 05:11:04,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-10: __VERIFIER_atomic_assert_#t~ret13#1 := isEmpty_#res#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume !__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-12: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-13: __VERIFIER_atomic_assert_#t~short14#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696: assume { :end_inline_assume_abort_if_not } true;havoc __VERIFIER_atomic_release_#t~mem5#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-1: push_#res#1 := 0; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-4: assume ((0 == #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] && 0 == #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset]; [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-4: assume !(((0 == #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] && 0 == #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset]); [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-5: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 1 == __VERIFIER_atomic_release_#t~mem5#1 then 1 else 0); [2025-02-08 05:11:04,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-6: #race := #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:04,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-7: #race := #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:04,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-8: #race := #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:04,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-9: #race := #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:04,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-10: SUMMARY for call __VERIFIER_atomic_release_#t~mem5#1 := read~int(__VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:04,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:04,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: assume ((#race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1 && #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: assume !(((#race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1 && #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1); [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-1: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-2: #race := #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-3: #race := #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-4: #race := #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-5: #race := #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-6: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-7: SUMMARY for call write~int(0, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-1: assume false; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-3: assume false; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet10#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet10#1); [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc push_#t~nondet10#1; [2025-02-08 05:11:04,035 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet10#1]; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-3: havoc push_#t~nondet10#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: havoc __VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset;assume { :end_inline___VERIFIER_atomic_acquire } true; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: havoc __VERIFIER_atomic_acquire_#t~mem3#1, __VERIFIER_atomic_acquire_#t~nondet4#1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-3: havoc __VERIFIER_atomic_acquire_#t~mem3#1, __VERIFIER_atomic_acquire_#t~nondet4#1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-4: assume { :begin_inline___VERIFIER_atomic_acquire } true;__VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset := ~#m~0.base, ~#m~0.offset; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume 0 == #race~top~0; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(0 == #race~top~0); [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: push_~oldTop~0#1 := ~top~0; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: #race~top~0 := 0; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet11#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet11#1); [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc push_#t~nondet11#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet11#1]; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-3: havoc push_#t~nondet11#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_loop_#t~ret16#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: push_loop_~r~0#1 := push_loop_#t~ret16#1; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret16#1 && push_loop_#t~ret16#1 <= 2147483647; [2025-02-08 05:11:04,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: havoc push_#in~d#1; [2025-02-08 05:11:04,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: havoc push_#t~ret9#1, push_#t~nondet10#1, push_#t~nondet11#1, push_#t~nondet12#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1; [2025-02-08 05:11:04,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: push_loop_#t~ret16#1 := push_#res#1; [2025-02-08 05:11:04,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume #race~top~0 == push_#t~nondet12#1; [2025-02-08 05:11:04,037 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume !(#race~top~0 == push_#t~nondet12#1); [2025-02-08 05:11:04,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc push_#t~nondet12#1; [2025-02-08 05:11:04,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: #race~top~0 := push_#t~nondet12#1; [2025-02-08 05:11:04,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: havoc push_#t~nondet12#1; [2025-02-08 05:11:04,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: ~top~0 := push_~newTop~0#1; [2025-02-08 05:11:04,038 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-2: havoc __VERIFIER_atomic_assert_#t~ret13#1, __VERIFIER_atomic_assert_#t~short14#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-3: havoc __VERIFIER_atomic_assert_#t~ret13#1, __VERIFIER_atomic_assert_#t~short14#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: [2025-02-08 05:11:04,039 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc __VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset;assume { :end_inline___VERIFIER_atomic_release } true; [2025-02-08 05:11:04,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: havoc __VERIFIER_atomic_release_#t~mem5#1, __VERIFIER_atomic_release_#t~nondet6#1, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset; [2025-02-08 05:11:04,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: havoc __VERIFIER_atomic_release_#t~mem5#1, __VERIFIER_atomic_release_#t~nondet6#1, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset; [2025-02-08 05:11:04,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-4: assume { :begin_inline___VERIFIER_atomic_release } true;__VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset := ~#m~0.base, ~#m~0.offset; [2025-02-08 05:11:04,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume 0 == ~top~0; [2025-02-08 05:11:04,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(0 == ~top~0); [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume 0 == #race~top~0; [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume !(0 == #race~top~0); [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: #race~top~0 := 0; [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: push_#res#1 := 1; [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:04,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume { :end_inline_assume_abort_if_not } true;havoc __VERIFIER_atomic_acquire_#t~mem3#1; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-4: assume ((0 == #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset]; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-4: assume !(((0 == #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset]); [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-5: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 == __VERIFIER_atomic_acquire_#t~mem3#1 then 1 else 0); [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-6: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-7: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-8: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-9: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-10: SUMMARY for call __VERIFIER_atomic_acquire_#t~mem3#1 := read~int(__VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:04,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume ((#race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1 && #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume !(((#race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1 && #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1); [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-1: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-2: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-3: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-4: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-5: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-6: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-7: SUMMARY for call write~int(1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc push_#t~ret9#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: push_~newTop~0#1 := push_#t~ret9#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret9#1 && push_#t~ret9#1 <= 2147483647; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-3: havoc index_malloc_#t~nondet7#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-4: push_#t~ret9#1 := index_malloc_#res#1; [2025-02-08 05:11:04,043 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:04,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:04,047 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-3: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-4: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !!__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-6: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:04,048 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-7: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:04,148 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:04,148 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:04,394 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:04,394 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:04,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:04 BoogieIcfgContainer [2025-02-08 05:11:04,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:04,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:04,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:04,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:04,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:02" (1/3) ... [2025-02-08 05:11:04,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3843f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:04, skipping insertion in model container [2025-02-08 05:11:04,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:03" (2/3) ... [2025-02-08 05:11:04,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3843f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:04, skipping insertion in model container [2025-02-08 05:11:04,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:04" (3/3) ... [2025-02-08 05:11:04,407 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack-race.i [2025-02-08 05:11:04,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:04,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack-race.i that has 2 procedures, 173 locations, 1 initial locations, 2 loop locations, and 26 error locations. [2025-02-08 05:11:04,424 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:04,504 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:04,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 175 transitions, 354 flow [2025-02-08 05:11:04,634 INFO L124 PetriNetUnfolderBase]: 2/182 cut-off events. [2025-02-08 05:11:04,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:04,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 182 events. 2/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-08 05:11:04,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 175 transitions, 354 flow [2025-02-08 05:11:04,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 175 transitions, 354 flow [2025-02-08 05:11:04,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:04,677 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;@725d410a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:04,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:04,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:04,705 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-08 05:11:04,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:04,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:04,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:04,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:04,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash -470235785, now seen corresponding path program 1 times [2025-02-08 05:11:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291161765] [2025-02-08 05:11:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:04,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:11:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:11:04,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:04,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:05,624 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:11:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291161765] [2025-02-08 05:11:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291161765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:05,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143773557] [2025-02-08 05:11:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:05,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:05,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:05,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 175 [2025-02-08 05:11:05,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 175 transitions, 354 flow. Second operand has 2 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 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:11:05,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:05,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 175 [2025-02-08 05:11:05,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:05,750 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2025-02-08 05:11:05,750 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 162 events. 2/162 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 7/159 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2025-02-08 05:11:05,752 INFO L140 encePairwiseOnDemand]: 163/175 looper letters, 6 selfloop transitions, 0 changer transitions 0/159 dead transitions. [2025-02-08 05:11:05,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 334 flow [2025-02-08 05:11:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 332 transitions. [2025-02-08 05:11:05,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485714285714286 [2025-02-08 05:11:05,769 INFO L175 Difference]: Start difference. First operand has 176 places, 175 transitions, 354 flow. Second operand 2 states and 332 transitions. [2025-02-08 05:11:05,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 334 flow [2025-02-08 05:11:05,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:05,779 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 322 flow [2025-02-08 05:11:05,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-02-08 05:11:05,786 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, -15 predicate places. [2025-02-08 05:11:05,787 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 322 flow [2025-02-08 05:11:05,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 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:11:05,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:05,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:05,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:05,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:05,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -924996293, now seen corresponding path program 1 times [2025-02-08 05:11:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:05,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158681560] [2025-02-08 05:11:05,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:05,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:05,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:05,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:05,923 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:11:05,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:05,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158681560] [2025-02-08 05:11:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158681560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:05,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:05,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132732463] [2025-02-08 05:11:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:05,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:05,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:05,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:05,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 175 [2025-02-08 05:11:05,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:11:05,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:05,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 175 [2025-02-08 05:11:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:06,015 INFO L124 PetriNetUnfolderBase]: 2/209 cut-off events. [2025-02-08 05:11:06,015 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:06,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 209 events. 2/209 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 200 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 224. Up to 8 conditions per place. [2025-02-08 05:11:06,017 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 11 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-02-08 05:11:06,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 162 transitions, 354 flow [2025-02-08 05:11:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:11:06,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900952380952381 [2025-02-08 05:11:06,022 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 322 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:11:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 162 transitions, 354 flow [2025-02-08 05:11:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 162 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:06,029 INFO L231 Difference]: Finished difference. Result has 162 places, 158 transitions, 324 flow [2025-02-08 05:11:06,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=162, PETRI_TRANSITIONS=158} [2025-02-08 05:11:06,030 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, -14 predicate places. [2025-02-08 05:11:06,030 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 158 transitions, 324 flow [2025-02-08 05:11:06,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:11:06,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:06,031 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:11:06,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:06,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:06,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 777158, now seen corresponding path program 1 times [2025-02-08 05:11:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019623538] [2025-02-08 05:11:06,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:06,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:06,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:06,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:06,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:06,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:06,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:06,141 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:06,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:06,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:06,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:06,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:06,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:06,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:06,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:06,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:06,147 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:06,150 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:06,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:06,223 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:06,273 INFO L124 PetriNetUnfolderBase]: 4/273 cut-off events. [2025-02-08 05:11:06,273 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:06,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 273 events. 4/273 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 586 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 183. Up to 3 conditions per place. [2025-02-08 05:11:06,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:06,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:06,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:06,286 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;@725d410a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:06,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:06,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:06,298 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-08 05:11:06,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:06,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:06,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:06,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:06,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:06,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2129640233, now seen corresponding path program 1 times [2025-02-08 05:11:06,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:06,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540050949] [2025-02-08 05:11:06,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:06,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:06,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:11:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:11:06,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540050949] [2025-02-08 05:11:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540050949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103135274] [2025-02-08 05:11:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:06,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:06,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:06,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 257 [2025-02-08 05:11:06,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 257 transitions, 524 flow. Second operand has 2 states, 2 states have (on average 223.0) internal successors, (446), 2 states have internal predecessors, (446), 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:11:06,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:06,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 257 [2025-02-08 05:11:06,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:06,890 INFO L124 PetriNetUnfolderBase]: 38/641 cut-off events. [2025-02-08 05:11:06,890 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 641 events. 38/641 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2945 event pairs, 23 based on Foata normal form. 46/605 useless extension candidates. Maximal degree in co-relation 529. Up to 66 conditions per place. [2025-02-08 05:11:06,899 INFO L140 encePairwiseOnDemand]: 234/257 looper letters, 12 selfloop transitions, 0 changer transitions 0/229 dead transitions. [2025-02-08 05:11:06,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 492 flow [2025-02-08 05:11:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 479 transitions. [2025-02-08 05:11:06,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9319066147859922 [2025-02-08 05:11:06,902 INFO L175 Difference]: Start difference. First operand has 258 places, 257 transitions, 524 flow. Second operand 2 states and 479 transitions. [2025-02-08 05:11:06,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 492 flow [2025-02-08 05:11:06,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 229 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:06,908 INFO L231 Difference]: Finished difference. Result has 231 places, 229 transitions, 468 flow [2025-02-08 05:11:06,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=468, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2025-02-08 05:11:06,911 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -27 predicate places. [2025-02-08 05:11:06,911 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 468 flow [2025-02-08 05:11:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 223.0) internal successors, (446), 2 states have internal predecessors, (446), 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:11:06,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:06,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:06,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:06,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2115098451, now seen corresponding path program 1 times [2025-02-08 05:11:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043937126] [2025-02-08 05:11:06,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:06,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:06,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:06,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:06,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:06,989 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:11:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043937126] [2025-02-08 05:11:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043937126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398358094] [2025-02-08 05:11:06,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:06,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:06,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:07,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 257 [2025-02-08 05:11:07,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:11:07,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:07,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 257 [2025-02-08 05:11:07,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:07,385 INFO L124 PetriNetUnfolderBase]: 151/1738 cut-off events. [2025-02-08 05:11:07,386 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:11:07,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 1738 events. 151/1738 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13164 event pairs, 50 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2063. Up to 147 conditions per place. [2025-02-08 05:11:07,401 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 31 selfloop transitions, 6 changer transitions 0/246 dead transitions. [2025-02-08 05:11:07,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 246 transitions, 581 flow [2025-02-08 05:11:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2025-02-08 05:11:07,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8832684824902723 [2025-02-08 05:11:07,404 INFO L175 Difference]: Start difference. First operand has 231 places, 229 transitions, 468 flow. Second operand 3 states and 681 transitions. [2025-02-08 05:11:07,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 246 transitions, 581 flow [2025-02-08 05:11:07,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 246 transitions, 581 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:07,408 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 520 flow [2025-02-08 05:11:07,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2025-02-08 05:11:07,410 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -23 predicate places. [2025-02-08 05:11:07,410 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 520 flow [2025-02-08 05:11:07,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:11:07,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:07,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:07,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:07,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1241289986, now seen corresponding path program 1 times [2025-02-08 05:11:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221040311] [2025-02-08 05:11:07,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:11:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:11:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:07,494 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:11:07,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221040311] [2025-02-08 05:11:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221040311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:07,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:07,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:07,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077650987] [2025-02-08 05:11:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:07,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:07,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:07,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 257 [2025-02-08 05:11:07,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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:11:07,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:07,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 257 [2025-02-08 05:11:07,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:07,853 INFO L124 PetriNetUnfolderBase]: 196/1829 cut-off events. [2025-02-08 05:11:07,854 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-08 05:11:07,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 1829 events. 196/1829 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 14496 event pairs, 98 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 2320. Up to 314 conditions per place. [2025-02-08 05:11:07,878 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 25 selfloop transitions, 4 changer transitions 0/244 dead transitions. [2025-02-08 05:11:07,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 244 transitions, 601 flow [2025-02-08 05:11:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2025-02-08 05:11:07,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8715953307392996 [2025-02-08 05:11:07,884 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 520 flow. Second operand 3 states and 672 transitions. [2025-02-08 05:11:07,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 244 transitions, 601 flow [2025-02-08 05:11:07,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 244 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:07,891 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 538 flow [2025-02-08 05:11:07,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-02-08 05:11:07,892 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -21 predicate places. [2025-02-08 05:11:07,892 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 538 flow [2025-02-08 05:11:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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:11:07,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,893 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-02-08 05:11:07,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:07,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:07,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -496404948, now seen corresponding path program 1 times [2025-02-08 05:11:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604193393] [2025-02-08 05:11:07,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:11:07,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:11:07,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:07,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:07,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:11:07,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:11:07,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:07,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:07,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:07,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:07,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:07,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:07,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:07,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:07,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:07,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:07,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:07,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:07,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:07,953 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:11:07,954 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:07,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:08,024 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:08,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 339 transitions, 696 flow [2025-02-08 05:11:08,102 INFO L124 PetriNetUnfolderBase]: 6/364 cut-off events. [2025-02-08 05:11:08,103 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:08,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 364 events. 6/364 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1117 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 277. Up to 4 conditions per place. [2025-02-08 05:11:08,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 339 transitions, 696 flow [2025-02-08 05:11:08,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 340 places, 339 transitions, 696 flow [2025-02-08 05:11:08,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:08,115 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;@725d410a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:08,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:08,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:08,123 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-08 05:11:08,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:08,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:08,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:08,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:08,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1008770035, now seen corresponding path program 1 times [2025-02-08 05:11:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299227922] [2025-02-08 05:11:08,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:08,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:11:08,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:11:08,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:08,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:08,375 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:11:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299227922] [2025-02-08 05:11:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299227922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503329413] [2025-02-08 05:11:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:08,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:08,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:08,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 339 [2025-02-08 05:11:08,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 339 transitions, 696 flow. Second operand has 2 states, 2 states have (on average 288.0) internal successors, (576), 2 states have internal predecessors, (576), 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:11:08,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:08,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 339 [2025-02-08 05:11:08,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:09,086 INFO L124 PetriNetUnfolderBase]: 392/3554 cut-off events. [2025-02-08 05:11:09,087 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 3554 events. 392/3554 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32357 event pairs, 294 based on Foata normal form. 306/3348 useless extension candidates. Maximal degree in co-relation 3352. Up to 561 conditions per place. [2025-02-08 05:11:09,135 INFO L140 encePairwiseOnDemand]: 305/339 looper letters, 18 selfloop transitions, 0 changer transitions 0/299 dead transitions. [2025-02-08 05:11:09,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 299 transitions, 652 flow [2025-02-08 05:11:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 626 transitions. [2025-02-08 05:11:09,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9233038348082596 [2025-02-08 05:11:09,140 INFO L175 Difference]: Start difference. First operand has 340 places, 339 transitions, 696 flow. Second operand 2 states and 626 transitions. [2025-02-08 05:11:09,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 299 transitions, 652 flow [2025-02-08 05:11:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 650 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:09,146 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 614 flow [2025-02-08 05:11:09,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=614, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2025-02-08 05:11:09,149 INFO L279 CegarLoopForPetriNet]: 340 programPoint places, -39 predicate places. [2025-02-08 05:11:09,149 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 614 flow [2025-02-08 05:11:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 288.0) internal successors, (576), 2 states have internal predecessors, (576), 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:11:09,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:09,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:09,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1234653937, now seen corresponding path program 1 times [2025-02-08 05:11:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595195146] [2025-02-08 05:11:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:09,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:09,214 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:11:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595195146] [2025-02-08 05:11:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595195146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419018734] [2025-02-08 05:11:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:09,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 339 [2025-02-08 05:11:09,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:11:09,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:09,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 339 [2025-02-08 05:11:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:12,209 INFO L124 PetriNetUnfolderBase]: 3244/19445 cut-off events. [2025-02-08 05:11:12,209 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-02-08 05:11:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24737 conditions, 19445 events. 3244/19445 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 253609 event pairs, 1156 based on Foata normal form. 0/16603 useless extension candidates. Maximal degree in co-relation 24731. Up to 2476 conditions per place. [2025-02-08 05:11:12,518 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 47 selfloop transitions, 9 changer transitions 0/325 dead transitions. [2025-02-08 05:11:12,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 325 transitions, 788 flow [2025-02-08 05:11:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-08 05:11:12,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8692232055063913 [2025-02-08 05:11:12,522 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 614 flow. Second operand 3 states and 884 transitions. [2025-02-08 05:11:12,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 325 transitions, 788 flow [2025-02-08 05:11:12,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 325 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:12,529 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 692 flow [2025-02-08 05:11:12,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2025-02-08 05:11:12,531 INFO L279 CegarLoopForPetriNet]: 340 programPoint places, -35 predicate places. [2025-02-08 05:11:12,531 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 692 flow [2025-02-08 05:11:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:11:12,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:12,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:11:12,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:12,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash 771998833, now seen corresponding path program 1 times [2025-02-08 05:11:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:12,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456517518] [2025-02-08 05:11:12,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:12,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:11:12,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:11:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:12,602 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:11:12,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456517518] [2025-02-08 05:11:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456517518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:12,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168783773] [2025-02-08 05:11:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:12,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:12,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:12,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-08 05:11:12,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:11:12,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:12,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-08 05:11:12,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:14,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [34#L767-1true, 350#true, 337#true, 24#L775-2true, 299#L767-1true, 103#L763-1true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:14,487 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-02-08 05:11:14,487 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:11:14,487 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:14,488 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:11:14,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [34#L767-1true, 350#true, 337#true, 24#L775-2true, 299#L767-1true, 302#L763true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:14,533 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-02-08 05:11:14,533 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:11:14,533 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:14,533 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:11:15,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [34#L767-1true, 350#true, 337#true, 24#L775-2true, 9#L706-2true, 103#L763-1true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:15,319 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-02-08 05:11:15,319 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-02-08 05:11:15,319 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:15,319 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-02-08 05:11:15,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [337#true, 34#L767-1true, 350#true, 24#L775-2true, 9#L706-2true, 302#L763true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:15,345 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-02-08 05:11:15,345 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:11:15,345 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:11:15,345 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:11:15,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [34#L767-1true, 350#true, 337#true, 24#L775-2true, 147#L708true, 103#L763-1true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:15,414 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-02-08 05:11:15,414 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-02-08 05:11:15,414 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-02-08 05:11:15,414 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-02-08 05:11:15,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][184], [337#true, 34#L767-1true, 350#true, 24#L775-2true, 147#L708true, 302#L763true, 339#true, 345#true, Black: 347#(= |#race~state~0| 0), 343#true, 341#true]) [2025-02-08 05:11:15,440 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-02-08 05:11:15,440 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-02-08 05:11:15,440 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-02-08 05:11:15,440 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-02-08 05:11:15,778 INFO L124 PetriNetUnfolderBase]: 4472/27134 cut-off events. [2025-02-08 05:11:15,778 INFO L125 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-02-08 05:11:15,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35445 conditions, 27134 events. 4472/27134 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 385060 event pairs, 2326 based on Foata normal form. 0/23225 useless extension candidates. Maximal degree in co-relation 35437. Up to 5488 conditions per place. [2025-02-08 05:11:16,086 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 38 selfloop transitions, 5 changer transitions 0/324 dead transitions. [2025-02-08 05:11:16,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 324 transitions, 820 flow [2025-02-08 05:11:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-02-08 05:11:16,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633235004916421 [2025-02-08 05:11:16,089 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 692 flow. Second operand 3 states and 878 transitions. [2025-02-08 05:11:16,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 324 transitions, 820 flow [2025-02-08 05:11:16,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 324 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:16,101 INFO L231 Difference]: Finished difference. Result has 307 places, 312 transitions, 712 flow [2025-02-08 05:11:16,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=307, PETRI_TRANSITIONS=312} [2025-02-08 05:11:16,105 INFO L279 CegarLoopForPetriNet]: 340 programPoint places, -33 predicate places. [2025-02-08 05:11:16,106 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 312 transitions, 712 flow [2025-02-08 05:11:16,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:11:16,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:16,107 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:11:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:11:16,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 898708398, now seen corresponding path program 1 times [2025-02-08 05:11:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10490221] [2025-02-08 05:11:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:16,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:11:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:11:16,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:16,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:16,168 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:11:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10490221] [2025-02-08 05:11:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10490221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:16,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98077007] [2025-02-08 05:11:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:16,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:16,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:16,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:16,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-08 05:11:16,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 312 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:11:16,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:16,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-08 05:11:16,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:17,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][182], [350#true, 337#true, 34#L767-1true, 24#L775-2true, Black: 352#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 187#L717-1true, 339#true, 357#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), Black: 347#(= |#race~state~0| 0), 341#true, 343#true, 232#L767-1true]) [2025-02-08 05:11:17,833 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:11:17,833 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-08 05:11:17,833 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-08 05:11:17,833 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-08 05:11:18,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][182], [350#true, 337#true, 24#L775-2true, Black: 352#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 102#L706-2true, 339#true, 187#L717-1true, 357#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), Black: 347#(= |#race~state~0| 0), 341#true, 343#true, 232#L767-1true]) [2025-02-08 05:11:18,999 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-02-08 05:11:18,999 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:18,999 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:18,999 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:19,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][182], [350#true, 337#true, 24#L775-2true, Black: 352#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 148#L708true, 339#true, 357#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 187#L717-1true, Black: 347#(= |#race~state~0| 0), 341#true, 343#true, 232#L767-1true]) [2025-02-08 05:11:19,117 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-02-08 05:11:19,117 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:11:19,117 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:11:19,117 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:11:19,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][182], [350#true, 337#true, 24#L775-2true, Black: 352#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 339#true, 187#L717-1true, 357#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 226#L714-1true, Black: 347#(= |#race~state~0| 0), 341#true, 343#true, 232#L767-1true]) [2025-02-08 05:11:19,348 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-02-08 05:11:19,348 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:19,348 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:19,348 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:19,551 INFO L124 PetriNetUnfolderBase]: 5148/29173 cut-off events. [2025-02-08 05:11:19,551 INFO L125 PetriNetUnfolderBase]: For 1780/1872 co-relation queries the response was YES. [2025-02-08 05:11:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39817 conditions, 29173 events. 5148/29173 cut-off events. For 1780/1872 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 418858 event pairs, 2709 based on Foata normal form. 0/24956 useless extension candidates. Maximal degree in co-relation 39808. Up to 6431 conditions per place. [2025-02-08 05:11:20,073 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 38 selfloop transitions, 7 changer transitions 0/328 dead transitions. [2025-02-08 05:11:20,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 328 transitions, 849 flow [2025-02-08 05:11:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2025-02-08 05:11:20,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8623402163225172 [2025-02-08 05:11:20,075 INFO L175 Difference]: Start difference. First operand has 307 places, 312 transitions, 712 flow. Second operand 3 states and 877 transitions. [2025-02-08 05:11:20,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 328 transitions, 849 flow [2025-02-08 05:11:20,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 328 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:20,100 INFO L231 Difference]: Finished difference. Result has 309 places, 317 transitions, 758 flow [2025-02-08 05:11:20,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=309, PETRI_TRANSITIONS=317} [2025-02-08 05:11:20,101 INFO L279 CegarLoopForPetriNet]: 340 programPoint places, -31 predicate places. [2025-02-08 05:11:20,101 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 317 transitions, 758 flow [2025-02-08 05:11:20,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:11:20,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:20,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:11:20,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err21ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 46719194, now seen corresponding path program 1 times [2025-02-08 05:11:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831734108] [2025-02-08 05:11:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:20,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:11:20,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:11:20,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:20,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:20,157 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:11:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831734108] [2025-02-08 05:11:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831734108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668040805] [2025-02-08 05:11:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:20,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:20,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:20,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 339 [2025-02-08 05:11:20,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 317 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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:11:20,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:20,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 339 [2025-02-08 05:11:20,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:25,057 INFO L124 PetriNetUnfolderBase]: 7106/45782 cut-off events. [2025-02-08 05:11:25,058 INFO L125 PetriNetUnfolderBase]: For 3259/4097 co-relation queries the response was YES. [2025-02-08 05:11:25,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61053 conditions, 45782 events. 7106/45782 cut-off events. For 3259/4097 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 702869 event pairs, 2774 based on Foata normal form. 50/39440 useless extension candidates. Maximal degree in co-relation 61043. Up to 7604 conditions per place. [2025-02-08 05:11:25,488 INFO L140 encePairwiseOnDemand]: 331/339 looper letters, 49 selfloop transitions, 12 changer transitions 0/343 dead transitions. [2025-02-08 05:11:25,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 343 transitions, 958 flow [2025-02-08 05:11:25,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2025-02-08 05:11:25,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652900688298918 [2025-02-08 05:11:25,490 INFO L175 Difference]: Start difference. First operand has 309 places, 317 transitions, 758 flow. Second operand 3 states and 880 transitions. [2025-02-08 05:11:25,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 343 transitions, 958 flow [2025-02-08 05:11:25,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 343 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:25,505 INFO L231 Difference]: Finished difference. Result has 311 places, 327 transitions, 850 flow [2025-02-08 05:11:25,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=311, PETRI_TRANSITIONS=327} [2025-02-08 05:11:25,506 INFO L279 CegarLoopForPetriNet]: 340 programPoint places, -29 predicate places. [2025-02-08 05:11:25,506 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 327 transitions, 850 flow [2025-02-08 05:11:25,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 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:11:25,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:25,507 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:25,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:11:25,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:25,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1892017415, now seen corresponding path program 1 times [2025-02-08 05:11:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234079570] [2025-02-08 05:11:25,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:11:25,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:11:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:25,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:25,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:11:25,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:11:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:25,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:25,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:25,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:11:25,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:11:25,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:11:25,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:11:25,568 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:11:25,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:11:25,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:11:25,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:11:25,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:11:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:11:25,571 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:11:25,572 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:25,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:25,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:25,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 422 places, 421 transitions, 870 flow [2025-02-08 05:11:25,727 INFO L124 PetriNetUnfolderBase]: 8/455 cut-off events. [2025-02-08 05:11:25,727 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 455 events. 8/455 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1688 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 372. Up to 5 conditions per place. [2025-02-08 05:11:25,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 422 places, 421 transitions, 870 flow [2025-02-08 05:11:25,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 422 places, 421 transitions, 870 flow [2025-02-08 05:11:25,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:25,745 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;@725d410a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:25,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:11:25,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:25,750 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-08 05:11:25,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:25,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:25,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:25,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:11:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1295526813, now seen corresponding path program 1 times [2025-02-08 05:11:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:25,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393202238] [2025-02-08 05:11:25,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:11:25,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:11:25,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:25,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393202238] [2025-02-08 05:11:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393202238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391600272] [2025-02-08 05:11:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:25,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:25,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:25,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 421 [2025-02-08 05:11:25,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 421 transitions, 870 flow. Second operand has 2 states, 2 states have (on average 353.0) internal successors, (706), 2 states have internal predecessors, (706), 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:11:25,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:25,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 421 [2025-02-08 05:11:25,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:29,262 INFO L124 PetriNetUnfolderBase]: 3368/21591 cut-off events. [2025-02-08 05:11:29,263 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:11:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26987 conditions, 21591 events. 3368/21591 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 282134 event pairs, 2768 based on Foata normal form. 2032/20555 useless extension candidates. Maximal degree in co-relation 21526. Up to 4393 conditions per place. [2025-02-08 05:11:29,452 INFO L140 encePairwiseOnDemand]: 376/421 looper letters, 24 selfloop transitions, 0 changer transitions 0/369 dead transitions. [2025-02-08 05:11:29,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 814 flow [2025-02-08 05:11:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 773 transitions. [2025-02-08 05:11:29,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9180522565320665 [2025-02-08 05:11:29,455 INFO L175 Difference]: Start difference. First operand has 422 places, 421 transitions, 870 flow. Second operand 2 states and 773 transitions. [2025-02-08 05:11:29,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 814 flow [2025-02-08 05:11:29,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 369 transitions, 808 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:29,461 INFO L231 Difference]: Finished difference. Result has 371 places, 369 transitions, 760 flow [2025-02-08 05:11:29,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=760, PETRI_PLACES=371, PETRI_TRANSITIONS=369} [2025-02-08 05:11:29,462 INFO L279 CegarLoopForPetriNet]: 422 programPoint places, -51 predicate places. [2025-02-08 05:11:29,463 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 369 transitions, 760 flow [2025-02-08 05:11:29,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 353.0) internal successors, (706), 2 states have internal predecessors, (706), 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:11:29,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:29,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:11:29,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:11:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 539313287, now seen corresponding path program 1 times [2025-02-08 05:11:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281587788] [2025-02-08 05:11:29,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:29,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:29,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:29,513 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:11:29,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281587788] [2025-02-08 05:11:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281587788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:29,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:29,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:29,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249327882] [2025-02-08 05:11:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:29,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:29,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:29,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:29,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 421 [2025-02-08 05:11:29,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 369 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 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:11:29,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:29,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 421 [2025-02-08 05:11:29,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand