./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack_longer-1-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_longer-1-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 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:02,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:02,207 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:02,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:02,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:02,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:02,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:02,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:02,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:02,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:02,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:02,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:02,244 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:02,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:02,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:02,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:02,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:02,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:02,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:02,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:02,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:02,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:02,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:02,248 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 -> 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b [2025-02-08 05:11:02,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:02,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:02,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:02,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:02,546 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:02,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2025-02-08 05:11:03,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0590e758/c53b04ddbcbb4c8bb088637557828eb5/FLAG618197019 [2025-02-08 05:11:04,160 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:04,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2025-02-08 05:11:04,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0590e758/c53b04ddbcbb4c8bb088637557828eb5/FLAG618197019 [2025-02-08 05:11:04,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0590e758/c53b04ddbcbb4c8bb088637557828eb5 [2025-02-08 05:11:04,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:04,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:04,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:04,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:04,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:04,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b21d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04, skipping insertion in model container [2025-02-08 05:11:04,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:04,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:04,536 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:04,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:04,634 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:04,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04 WrapperNode [2025-02-08 05:11:04,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:04,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:04,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:04,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:04,643 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:04" (1/1) ... [2025-02-08 05:11:04,670 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:04" (1/1) ... [2025-02-08 05:11:04,737 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 928 [2025-02-08 05:11:04,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:04,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:04,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:04,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:04,750 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:04" (1/1) ... [2025-02-08 05:11:04,751 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:04" (1/1) ... [2025-02-08 05:11:04,758 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:04" (1/1) ... [2025-02-08 05:11:04,763 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:04" (1/1) ... [2025-02-08 05:11:04,798 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:04" (1/1) ... [2025-02-08 05:11:04,811 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:04" (1/1) ... [2025-02-08 05:11:04,816 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:04" (1/1) ... [2025-02-08 05:11:04,823 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:04" (1/1) ... [2025-02-08 05:11:04,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:04,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:04,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:04,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:04,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:04,879 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:04,884 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:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:04,910 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:05,048 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:05,050 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:05,633 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:05,634 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:05,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-10: __VERIFIER_atomic_assert_#t~ret13#1 := isEmpty_#res#1; [2025-02-08 05:11:05,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume !__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-12: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:05,635 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:05,635 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:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-1: push_#res#1 := 0; [2025-02-08 05:11:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,635 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:05,636 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:05,636 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:05,636 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:05,636 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:05,636 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:05,636 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:05,637 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:05,638 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:05,638 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:05,638 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:05,638 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:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-1: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:05,638 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:05,638 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:05,638 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:05,638 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:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-6: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:05,638 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:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-1: assume false; [2025-02-08 05:11:05,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-3: assume false; [2025-02-08 05:11:05,639 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:05,639 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:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc push_#t~nondet10#1; [2025-02-08 05:11:05,639 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:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-3: havoc push_#t~nondet10#1; [2025-02-08 05:11:05,639 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:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: [2025-02-08 05:11:05,639 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:05,639 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:05,639 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:05,639 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:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume 0 == #race~top~0; [2025-02-08 05:11:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(0 == #race~top~0); [2025-02-08 05:11:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: push_~oldTop~0#1 := ~top~0; [2025-02-08 05:11:05,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: #race~top~0 := 0; [2025-02-08 05:11:05,641 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:05,641 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:05,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc push_#t~nondet11#1; [2025-02-08 05:11:05,641 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:05,641 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-3: havoc push_#t~nondet11#1; [2025-02-08 05:11:05,641 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:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_loop_#t~ret16#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: push_loop_~r~0#1 := push_loop_#t~ret16#1; [2025-02-08 05:11:05,642 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:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: havoc push_#in~d#1; [2025-02-08 05:11:05,642 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:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: push_loop_#t~ret16#1 := push_#res#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume #race~top~0 == push_#t~nondet12#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume !(#race~top~0 == push_#t~nondet12#1); [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc push_#t~nondet12#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: #race~top~0 := push_#t~nondet12#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: havoc push_#t~nondet12#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: ~top~0 := push_~newTop~0#1; [2025-02-08 05:11:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 05:11:05,642 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:05,642 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:05,642 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:05,642 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:05,642 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: [2025-02-08 05:11:05,643 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:05,643 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:05,643 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:05,643 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:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume 0 == ~top~0; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(0 == ~top~0); [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume 0 == #race~top~0; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume !(0 == #race~top~0); [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: #race~top~0 := 0; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: push_#res#1 := 1; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:05,643 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:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:05,643 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:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,643 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:05,643 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:05,647 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:05,648 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:05,648 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:05,648 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:05,648 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:05,648 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:05,648 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:05,648 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:05,648 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:05,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-1: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:05,648 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:05,648 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:05,648 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:05,648 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:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-6: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:05,649 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:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc push_#t~ret9#1; [2025-02-08 05:11:05,649 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:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: push_~newTop~0#1 := push_#t~ret9#1; [2025-02-08 05:11:05,649 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:05,649 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:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-4: push_#t~ret9#1 := index_malloc_#res#1; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:05,649 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:05,649 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:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-3: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-4: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !!__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !!!__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:05,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-6: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:05,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-7: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:06,201 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:06,201 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:06,461 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:06,461 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:06,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:06 BoogieIcfgContainer [2025-02-08 05:11:06,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:06,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:06,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:06,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:06,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:04" (1/3) ... [2025-02-08 05:11:06,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb82e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:06, skipping insertion in model container [2025-02-08 05:11:06,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (2/3) ... [2025-02-08 05:11:06,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb82e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:06, skipping insertion in model container [2025-02-08 05:11:06,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:06" (3/3) ... [2025-02-08 05:11:06,471 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-1-race.i [2025-02-08 05:11:06,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:06,490 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack_longer-1-race.i that has 2 procedures, 749 locations, 1 initial locations, 2 loop locations, and 26 error locations. [2025-02-08 05:11:06,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:06,575 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:06,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:06,942 INFO L124 PetriNetUnfolderBase]: 2/758 cut-off events. [2025-02-08 05:11:06,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:06,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 758 events. 2/758 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-08 05:11:06,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:06,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:06,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:06,990 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;@c1f23a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:06,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:07,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:07,098 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:07,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:07,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,102 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:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1475655310, now seen corresponding path program 1 times [2025-02-08 05:11:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039602179] [2025-02-08 05:11:07,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:07,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:07,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:10,698 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:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039602179] [2025-02-08 05:11:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039602179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662622265] [2025-02-08 05:11:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:10,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:10,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:10,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:10,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 751 [2025-02-08 05:11:10,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 751 transitions, 1506 flow. Second operand has 2 states, 2 states have (on average 734.0) internal successors, (1468), 2 states have internal predecessors, (1468), 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:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 751 [2025-02-08 05:11:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:10,959 INFO L124 PetriNetUnfolderBase]: 2/738 cut-off events. [2025-02-08 05:11:10,959 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:10,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 738 events. 2/738 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 6/734 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2025-02-08 05:11:10,963 INFO L140 encePairwiseOnDemand]: 739/751 looper letters, 6 selfloop transitions, 0 changer transitions 0/735 dead transitions. [2025-02-08 05:11:10,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 735 transitions, 1486 flow [2025-02-08 05:11:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1484 transitions. [2025-02-08 05:11:10,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9880159786950732 [2025-02-08 05:11:10,987 INFO L175 Difference]: Start difference. First operand has 752 places, 751 transitions, 1506 flow. Second operand 2 states and 1484 transitions. [2025-02-08 05:11:10,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 735 transitions, 1486 flow [2025-02-08 05:11:11,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 735 transitions, 1486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:11,017 INFO L231 Difference]: Finished difference. Result has 737 places, 735 transitions, 1474 flow [2025-02-08 05:11:11,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=751, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1474, PETRI_PLACES=737, PETRI_TRANSITIONS=735} [2025-02-08 05:11:11,026 INFO L279 CegarLoopForPetriNet]: 752 programPoint places, -15 predicate places. [2025-02-08 05:11:11,026 INFO L471 AbstractCegarLoop]: Abstraction has has 737 places, 735 transitions, 1474 flow [2025-02-08 05:11:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 734.0) internal successors, (1468), 2 states have internal predecessors, (1468), 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:11,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:11,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:11,028 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:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 765609106, now seen corresponding path program 1 times [2025-02-08 05:11:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129697476] [2025-02-08 05:11:11,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:11,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:11,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:11,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:11,915 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:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:11,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129697476] [2025-02-08 05:11:11,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129697476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:11,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:11,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483297047] [2025-02-08 05:11:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:11,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:11,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:11,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:11,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 751 [2025-02-08 05:11:11,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 735 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 730.3333333333334) internal successors, (2191), 3 states have internal predecessors, (2191), 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:11,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:11,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 751 [2025-02-08 05:11:11,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:12,141 INFO L124 PetriNetUnfolderBase]: 2/785 cut-off events. [2025-02-08 05:11:12,141 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 785 events. 2/785 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/770 useless extension candidates. Maximal degree in co-relation 800. Up to 8 conditions per place. [2025-02-08 05:11:12,146 INFO L140 encePairwiseOnDemand]: 748/751 looper letters, 11 selfloop transitions, 2 changer transitions 0/738 dead transitions. [2025-02-08 05:11:12,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 738 transitions, 1506 flow [2025-02-08 05:11:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2201 transitions. [2025-02-08 05:11:12,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9769196626719929 [2025-02-08 05:11:12,156 INFO L175 Difference]: Start difference. First operand has 737 places, 735 transitions, 1474 flow. Second operand 3 states and 2201 transitions. [2025-02-08 05:11:12,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 738 transitions, 1506 flow [2025-02-08 05:11:12,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 738 transitions, 1506 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:12,172 INFO L231 Difference]: Finished difference. Result has 738 places, 734 transitions, 1476 flow [2025-02-08 05:11:12,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=751, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=738, PETRI_TRANSITIONS=734} [2025-02-08 05:11:12,175 INFO L279 CegarLoopForPetriNet]: 752 programPoint places, -14 predicate places. [2025-02-08 05:11:12,175 INFO L471 AbstractCegarLoop]: Abstraction has has 738 places, 734 transitions, 1476 flow [2025-02-08 05:11:12,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.3333333333334) internal successors, (2191), 3 states have internal predecessors, (2191), 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,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:12,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:12,180 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:12,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1385581565, now seen corresponding path program 1 times [2025-02-08 05:11:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:12,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597532112] [2025-02-08 05:11:12,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:12,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:12,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:12,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:12,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:12,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:12,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:12,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:12,828 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:12,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:12,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:12,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:12,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:12,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:12,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:12,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:12,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:12,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:12,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:12,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:12,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:12,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:12,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:12,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:12,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:12,838 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:12,840 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:12,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:12,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:12,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:13,129 INFO L124 PetriNetUnfolderBase]: 4/849 cut-off events. [2025-02-08 05:11:13,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:13,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 849 events. 4/849 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs, 0 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 759. Up to 3 conditions per place. [2025-02-08 05:11:13,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:13,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:13,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:13,145 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;@c1f23a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:13,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:13,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:13,237 INFO L124 PetriNetUnfolderBase]: 0/669 cut-off events. [2025-02-08 05:11:13,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:13,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:13,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,238 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:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2049845888, now seen corresponding path program 1 times [2025-02-08 05:11:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966267335] [2025-02-08 05:11:13,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:13,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:15,472 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:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966267335] [2025-02-08 05:11:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966267335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297352404] [2025-02-08 05:11:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:15,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:15,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:15,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 798 out of 833 [2025-02-08 05:11:15,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 833 transitions, 1676 flow. Second operand has 2 states, 2 states have (on average 799.0) internal successors, (1598), 2 states have internal predecessors, (1598), 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:15,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:15,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 798 of 833 [2025-02-08 05:11:15,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:15,822 INFO L124 PetriNetUnfolderBase]: 38/1217 cut-off events. [2025-02-08 05:11:15,823 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:15,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1217 events. 38/1217 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2913 event pairs, 23 based on Foata normal form. 44/1179 useless extension candidates. Maximal degree in co-relation 745. Up to 66 conditions per place. [2025-02-08 05:11:15,831 INFO L140 encePairwiseOnDemand]: 810/833 looper letters, 12 selfloop transitions, 0 changer transitions 0/805 dead transitions. [2025-02-08 05:11:15,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 805 transitions, 1644 flow [2025-02-08 05:11:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1631 transitions. [2025-02-08 05:11:15,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9789915966386554 [2025-02-08 05:11:15,837 INFO L175 Difference]: Start difference. First operand has 834 places, 833 transitions, 1676 flow. Second operand 2 states and 1631 transitions. [2025-02-08 05:11:15,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 805 transitions, 1644 flow [2025-02-08 05:11:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 805 transitions, 1644 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:15,853 INFO L231 Difference]: Finished difference. Result has 807 places, 805 transitions, 1620 flow [2025-02-08 05:11:15,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1620, PETRI_PLACES=807, PETRI_TRANSITIONS=805} [2025-02-08 05:11:15,856 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -27 predicate places. [2025-02-08 05:11:15,857 INFO L471 AbstractCegarLoop]: Abstraction has has 807 places, 805 transitions, 1620 flow [2025-02-08 05:11:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 799.0) internal successors, (1598), 2 states have internal predecessors, (1598), 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:15,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:15,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:15,859 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:15,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1487997372, now seen corresponding path program 1 times [2025-02-08 05:11:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:15,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668982799] [2025-02-08 05:11:15,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:16,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:16,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:16,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:16,215 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,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:16,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668982799] [2025-02-08 05:11:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668982799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138676498] [2025-02-08 05:11:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:16,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:16,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:16,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:16,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 833 [2025-02-08 05:11:16,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 805 transitions, 1620 flow. Second operand has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 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,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:16,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 833 [2025-02-08 05:11:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:16,866 INFO L124 PetriNetUnfolderBase]: 151/2351 cut-off events. [2025-02-08 05:11:16,866 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:11:16,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 2351 events. 151/2351 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13592 event pairs, 48 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2675. Up to 146 conditions per place. [2025-02-08 05:11:16,881 INFO L140 encePairwiseOnDemand]: 825/833 looper letters, 31 selfloop transitions, 6 changer transitions 0/822 dead transitions. [2025-02-08 05:11:16,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 822 transitions, 1733 flow [2025-02-08 05:11:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2409 transitions. [2025-02-08 05:11:16,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963985594237695 [2025-02-08 05:11:16,887 INFO L175 Difference]: Start difference. First operand has 807 places, 805 transitions, 1620 flow. Second operand 3 states and 2409 transitions. [2025-02-08 05:11:16,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 822 transitions, 1733 flow [2025-02-08 05:11:16,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 822 transitions, 1733 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:16,902 INFO L231 Difference]: Finished difference. Result has 811 places, 811 transitions, 1672 flow [2025-02-08 05:11:16,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1672, PETRI_PLACES=811, PETRI_TRANSITIONS=811} [2025-02-08 05:11:16,905 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -23 predicate places. [2025-02-08 05:11:16,905 INFO L471 AbstractCegarLoop]: Abstraction has has 811 places, 811 transitions, 1672 flow [2025-02-08 05:11:16,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 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,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:16,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:16,908 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:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -395502005, now seen corresponding path program 1 times [2025-02-08 05:11:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742652097] [2025-02-08 05:11:16,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:17,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-08 05:11:17,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-08 05:11:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:17,267 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:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742652097] [2025-02-08 05:11:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742652097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710001963] [2025-02-08 05:11:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:17,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:17,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 833 [2025-02-08 05:11:17,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 811 transitions, 1672 flow. Second operand has 3 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 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:17,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:17,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 833 [2025-02-08 05:11:17,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:17,937 INFO L124 PetriNetUnfolderBase]: 196/2405 cut-off events. [2025-02-08 05:11:17,937 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-08 05:11:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 2405 events. 196/2405 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 14561 event pairs, 98 based on Foata normal form. 0/2156 useless extension candidates. Maximal degree in co-relation 2896. Up to 314 conditions per place. [2025-02-08 05:11:17,956 INFO L140 encePairwiseOnDemand]: 828/833 looper letters, 25 selfloop transitions, 4 changer transitions 0/820 dead transitions. [2025-02-08 05:11:17,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 820 transitions, 1753 flow [2025-02-08 05:11:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2400 transitions. [2025-02-08 05:11:17,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603841536614646 [2025-02-08 05:11:17,963 INFO L175 Difference]: Start difference. First operand has 811 places, 811 transitions, 1672 flow. Second operand 3 states and 2400 transitions. [2025-02-08 05:11:17,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 820 transitions, 1753 flow [2025-02-08 05:11:17,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 811 places, 820 transitions, 1741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:17,980 INFO L231 Difference]: Finished difference. Result has 813 places, 814 transitions, 1690 flow [2025-02-08 05:11:17,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1690, PETRI_PLACES=813, PETRI_TRANSITIONS=814} [2025-02-08 05:11:17,982 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -21 predicate places. [2025-02-08 05:11:17,982 INFO L471 AbstractCegarLoop]: Abstraction has has 813 places, 814 transitions, 1690 flow [2025-02-08 05:11:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 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:17,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:17,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:17,985 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:17,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1446062595, now seen corresponding path program 1 times [2025-02-08 05:11:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439665479] [2025-02-08 05:11:17,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:18,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-02-08 05:11:18,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-02-08 05:11:18,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:18,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:18,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:18,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-02-08 05:11:18,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-02-08 05:11:18,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:18,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:18,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:18,414 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:18,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:18,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:18,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:18,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:18,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:18,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:18,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:18,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:18,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:11:18,422 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:18,422 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:18,515 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:18,805 INFO L124 PetriNetUnfolderBase]: 6/940 cut-off events. [2025-02-08 05:11:18,805 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:18,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 940 events. 6/940 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1102 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 853. Up to 4 conditions per place. [2025-02-08 05:11:18,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:18,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:18,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:18,820 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;@c1f23a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:18,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:18,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:18,891 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:18,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:18,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:18,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,892 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:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 226281892, now seen corresponding path program 1 times [2025-02-08 05:11:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202331946] [2025-02-08 05:11:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:19,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:19,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:19,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:19,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:20,173 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,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202331946] [2025-02-08 05:11:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202331946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959211463] [2025-02-08 05:11:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:20,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:20,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:20,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 863 out of 915 [2025-02-08 05:11:20,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 916 places, 915 transitions, 1848 flow. Second operand has 2 states, 2 states have (on average 864.0) internal successors, (1728), 2 states have internal predecessors, (1728), 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,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:20,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 863 of 915 [2025-02-08 05:11:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:21,425 INFO L124 PetriNetUnfolderBase]: 392/4130 cut-off events. [2025-02-08 05:11:21,425 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 4130 events. 392/4130 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 32327 event pairs, 294 based on Foata normal form. 303/3921 useless extension candidates. Maximal degree in co-relation 3352. Up to 561 conditions per place. [2025-02-08 05:11:21,475 INFO L140 encePairwiseOnDemand]: 881/915 looper letters, 18 selfloop transitions, 0 changer transitions 0/875 dead transitions. [2025-02-08 05:11:21,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 875 transitions, 1804 flow [2025-02-08 05:11:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1778 transitions. [2025-02-08 05:11:21,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9715846994535519 [2025-02-08 05:11:21,481 INFO L175 Difference]: Start difference. First operand has 916 places, 915 transitions, 1848 flow. Second operand 2 states and 1778 transitions. [2025-02-08 05:11:21,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 875 transitions, 1804 flow [2025-02-08 05:11:21,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 877 places, 875 transitions, 1802 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:21,498 INFO L231 Difference]: Finished difference. Result has 877 places, 875 transitions, 1766 flow [2025-02-08 05:11:21,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1766, PETRI_PLACES=877, PETRI_TRANSITIONS=875} [2025-02-08 05:11:21,501 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -39 predicate places. [2025-02-08 05:11:21,502 INFO L471 AbstractCegarLoop]: Abstraction has has 877 places, 875 transitions, 1766 flow [2025-02-08 05:11:21,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 864.0) internal successors, (1728), 2 states have internal predecessors, (1728), 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:21,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:21,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:21,504 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:21,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1586311480, now seen corresponding path program 1 times [2025-02-08 05:11:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208458526] [2025-02-08 05:11:21,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:21,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:21,897 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:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208458526] [2025-02-08 05:11:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208458526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955104078] [2025-02-08 05:11:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:21,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 851 out of 915 [2025-02-08 05:11:21,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 875 transitions, 1766 flow. Second operand has 3 states, 3 states have (on average 852.3333333333334) internal successors, (2557), 3 states have internal predecessors, (2557), 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:21,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:21,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 851 of 915 [2025-02-08 05:11:21,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:26,006 INFO L124 PetriNetUnfolderBase]: 3243/19987 cut-off events. [2025-02-08 05:11:26,007 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-02-08 05:11:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25279 conditions, 19987 events. 3243/19987 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 253139 event pairs, 1141 based on Foata normal form. 0/17147 useless extension candidates. Maximal degree in co-relation 25273. Up to 2476 conditions per place. [2025-02-08 05:11:26,198 INFO L140 encePairwiseOnDemand]: 903/915 looper letters, 47 selfloop transitions, 9 changer transitions 0/901 dead transitions. [2025-02-08 05:11:26,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 901 transitions, 1940 flow [2025-02-08 05:11:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2612 transitions. [2025-02-08 05:11:26,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515482695810564 [2025-02-08 05:11:26,206 INFO L175 Difference]: Start difference. First operand has 877 places, 875 transitions, 1766 flow. Second operand 3 states and 2612 transitions. [2025-02-08 05:11:26,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 901 transitions, 1940 flow [2025-02-08 05:11:26,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 901 transitions, 1940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:26,224 INFO L231 Difference]: Finished difference. Result has 881 places, 884 transitions, 1844 flow [2025-02-08 05:11:26,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1844, PETRI_PLACES=881, PETRI_TRANSITIONS=884} [2025-02-08 05:11:26,227 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -35 predicate places. [2025-02-08 05:11:26,227 INFO L471 AbstractCegarLoop]: Abstraction has has 881 places, 884 transitions, 1844 flow [2025-02-08 05:11:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 852.3333333333334) internal successors, (2557), 3 states have internal predecessors, (2557), 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:26,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:26,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:11:26,229 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:26,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1087028806, now seen corresponding path program 1 times [2025-02-08 05:11:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:26,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403546053] [2025-02-08 05:11:26,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:26,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:26,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-08 05:11:26,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-08 05:11:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:26,623 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:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403546053] [2025-02-08 05:11:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403546053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146621301] [2025-02-08 05:11:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:26,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 854 out of 915 [2025-02-08 05:11:26,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 884 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 856.0) internal successors, (2568), 3 states have internal predecessors, (2568), 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:26,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:26,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 854 of 915 [2025-02-08 05:11:26,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:29,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0), 217#L767-1true, 921#true]) [2025-02-08 05:11:29,501 INFO L294 olderBase$Statistics]: this new event has 727 ancestors and is cut-off event [2025-02-08 05:11:29,501 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:11:29,501 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:11:29,501 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:11:29,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0), 228#L763true, 217#L767-1true, 921#true]) [2025-02-08 05:11:29,616 INFO L294 olderBase$Statistics]: this new event has 728 ancestors and is cut-off event [2025-02-08 05:11:29,616 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:11:29,616 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:11:29,616 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:11:31,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 11#L706-2true, Black: 923#(= |#race~state~0| 0), 921#true]) [2025-02-08 05:11:31,095 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:11:31,095 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:11:31,095 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:11:31,095 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:31,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 11#L706-2true, Black: 923#(= |#race~state~0| 0), 228#L763true, 921#true]) [2025-02-08 05:11:31,169 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-08 05:11:31,169 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:11:31,169 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:11:31,169 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:11:31,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 926#true, 915#true, 482#L767-1true, 567#L708true, Black: 923#(= |#race~state~0| 0), 921#true]) [2025-02-08 05:11:31,354 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:11:31,354 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:31,354 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:31,354 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:11:31,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] 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][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 567#L708true, Black: 923#(= |#race~state~0| 0), 228#L763true, 921#true]) [2025-02-08 05:11:31,415 INFO L294 olderBase$Statistics]: this new event has 748 ancestors and is cut-off event [2025-02-08 05:11:31,415 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2025-02-08 05:11:31,415 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:11:31,415 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:11:32,142 INFO L124 PetriNetUnfolderBase]: 4471/27498 cut-off events. [2025-02-08 05:11:32,142 INFO L125 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-02-08 05:11:32,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35815 conditions, 27498 events. 4471/27498 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 381016 event pairs, 2321 based on Foata normal form. 0/23597 useless extension candidates. Maximal degree in co-relation 35807. Up to 5493 conditions per place. [2025-02-08 05:11:32,417 INFO L140 encePairwiseOnDemand]: 909/915 looper letters, 38 selfloop transitions, 5 changer transitions 0/900 dead transitions. [2025-02-08 05:11:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 900 transitions, 1972 flow [2025-02-08 05:11:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2606 transitions. [2025-02-08 05:11:32,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493624772313297 [2025-02-08 05:11:32,423 INFO L175 Difference]: Start difference. First operand has 881 places, 884 transitions, 1844 flow. Second operand 3 states and 2606 transitions. [2025-02-08 05:11:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 900 transitions, 1972 flow [2025-02-08 05:11:32,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 900 transitions, 1954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:32,445 INFO L231 Difference]: Finished difference. Result has 883 places, 888 transitions, 1864 flow [2025-02-08 05:11:32,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=879, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1864, PETRI_PLACES=883, PETRI_TRANSITIONS=888} [2025-02-08 05:11:32,450 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -33 predicate places. [2025-02-08 05:11:32,450 INFO L471 AbstractCegarLoop]: Abstraction has has 883 places, 888 transitions, 1864 flow [2025-02-08 05:11:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 856.0) internal successors, (2568), 3 states have internal predecessors, (2568), 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:32,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:32,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:11:32,453 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:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1259368553, now seen corresponding path program 1 times [2025-02-08 05:11:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701547012] [2025-02-08 05:11:32,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:32,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-08 05:11:32,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-08 05:11:32,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:32,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:32,838 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:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701547012] [2025-02-08 05:11:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701547012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:32,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592830007] [2025-02-08 05:11:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:32,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:32,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 854 out of 915 [2025-02-08 05:11:32,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 888 transitions, 1864 flow. Second operand has 3 states, 3 states have (on average 856.3333333333334) internal successors, (2569), 3 states have internal predecessors, (2569), 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:32,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:32,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 854 of 915 [2025-02-08 05:11:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:35,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] 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][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:35,596 INFO L294 olderBase$Statistics]: this new event has 726 ancestors and is cut-off event [2025-02-08 05:11:35,596 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:35,596 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:35,596 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:37,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] 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][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 750#L706-2true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:37,389 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:11:37,389 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:37,389 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:37,389 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:37,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] 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][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 100#L708true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:37,627 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-08 05:11:37,627 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:37,627 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:37,627 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:38,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] 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][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 837#L714-1true, 917#true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 370#L717-1true, 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:38,216 INFO L294 olderBase$Statistics]: this new event has 756 ancestors and is cut-off event [2025-02-08 05:11:38,216 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:38,217 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:38,217 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:38,565 INFO L124 PetriNetUnfolderBase]: 5145/29446 cut-off events. [2025-02-08 05:11:38,565 INFO L125 PetriNetUnfolderBase]: For 1803/1907 co-relation queries the response was YES. [2025-02-08 05:11:38,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40099 conditions, 29446 events. 5145/29446 cut-off events. For 1803/1907 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 413957 event pairs, 2700 based on Foata normal form. 0/25247 useless extension candidates. Maximal degree in co-relation 40090. Up to 6438 conditions per place. [2025-02-08 05:11:38,807 INFO L140 encePairwiseOnDemand]: 909/915 looper letters, 38 selfloop transitions, 7 changer transitions 0/904 dead transitions. [2025-02-08 05:11:38,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 904 transitions, 2001 flow [2025-02-08 05:11:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2605 transitions. [2025-02-08 05:11:38,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9489981785063752 [2025-02-08 05:11:38,812 INFO L175 Difference]: Start difference. First operand has 883 places, 888 transitions, 1864 flow. Second operand 3 states and 2605 transitions. [2025-02-08 05:11:38,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 904 transitions, 2001 flow [2025-02-08 05:11:38,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 904 transitions, 1987 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:38,834 INFO L231 Difference]: Finished difference. Result has 885 places, 893 transitions, 1910 flow [2025-02-08 05:11:38,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1910, PETRI_PLACES=885, PETRI_TRANSITIONS=893} [2025-02-08 05:11:38,837 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -31 predicate places. [2025-02-08 05:11:38,837 INFO L471 AbstractCegarLoop]: Abstraction has has 885 places, 893 transitions, 1910 flow [2025-02-08 05:11:38,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 856.3333333333334) internal successors, (2569), 3 states have internal predecessors, (2569), 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:38,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:38,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:11:38,839 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:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1971657885, now seen corresponding path program 1 times [2025-02-08 05:11:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155914265] [2025-02-08 05:11:38,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:38,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-08 05:11:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-08 05:11:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:39,134 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:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155914265] [2025-02-08 05:11:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155914265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90425501] [2025-02-08 05:11:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:39,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 852 out of 915 [2025-02-08 05:11:39,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 893 transitions, 1910 flow. Second operand has 3 states, 3 states have (on average 854.0) internal successors, (2562), 3 states have internal predecessors, (2562), 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:39,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:39,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 852 of 915 [2025-02-08 05:11:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:47,922 INFO L124 PetriNetUnfolderBase]: 7106/46358 cut-off events. [2025-02-08 05:11:47,923 INFO L125 PetriNetUnfolderBase]: For 3242/4080 co-relation queries the response was YES. [2025-02-08 05:11:48,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61629 conditions, 46358 events. 7106/46358 cut-off events. For 3242/4080 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 702955 event pairs, 2788 based on Foata normal form. 50/40032 useless extension candidates. Maximal degree in co-relation 61619. Up to 7604 conditions per place. [2025-02-08 05:11:48,384 INFO L140 encePairwiseOnDemand]: 907/915 looper letters, 49 selfloop transitions, 12 changer transitions 0/919 dead transitions. [2025-02-08 05:11:48,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 919 transitions, 2110 flow [2025-02-08 05:11:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2025-02-08 05:11:48,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500910746812387 [2025-02-08 05:11:48,389 INFO L175 Difference]: Start difference. First operand has 885 places, 893 transitions, 1910 flow. Second operand 3 states and 2608 transitions. [2025-02-08 05:11:48,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 919 transitions, 2110 flow [2025-02-08 05:11:48,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 885 places, 919 transitions, 2096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:48,409 INFO L231 Difference]: Finished difference. Result has 887 places, 903 transitions, 2002 flow [2025-02-08 05:11:48,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2002, PETRI_PLACES=887, PETRI_TRANSITIONS=903} [2025-02-08 05:11:48,411 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -29 predicate places. [2025-02-08 05:11:48,411 INFO L471 AbstractCegarLoop]: Abstraction has has 887 places, 903 transitions, 2002 flow [2025-02-08 05:11:48,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 854.0) internal successors, (2562), 3 states have internal predecessors, (2562), 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:48,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:48,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:11:48,414 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:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 559553662, now seen corresponding path program 1 times [2025-02-08 05:11:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336356971] [2025-02-08 05:11:48,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:48,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-02-08 05:11:48,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-02-08 05:11:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:48,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:48,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-02-08 05:11:48,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-02-08 05:11:48,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:48,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:48,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:48,806 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:48,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:11:48,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:11:48,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:11:48,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:11:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:11:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:11:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:11:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:11:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:11:48,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:11:48,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:11:48,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:11:48,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:11:48,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:11:48,813 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:11:48,813 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:48,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:49,063 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:49,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:49,336 INFO L124 PetriNetUnfolderBase]: 8/1031 cut-off events. [2025-02-08 05:11:49,337 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:49,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 1031 events. 8/1031 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1682 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 948. Up to 5 conditions per place. [2025-02-08 05:11:49,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:49,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:49,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:49,354 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;@c1f23a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:49,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:11:49,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:49,440 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:49,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:49,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:49,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,441 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:49,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 299935802, now seen corresponding path program 1 times [2025-02-08 05:11:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548498267] [2025-02-08 05:11:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:49,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:49,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:49,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:50,829 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:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548498267] [2025-02-08 05:11:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548498267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:50,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162939653] [2025-02-08 05:11:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:50,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:50,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:50,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 928 out of 997 [2025-02-08 05:11:50,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 997 transitions, 2022 flow. Second operand has 2 states, 2 states have (on average 929.0) internal successors, (1858), 2 states have internal predecessors, (1858), 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:50,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:50,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 928 of 997 [2025-02-08 05:11:50,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand