./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:40,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:40,981 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:37:40,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:40,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:40,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:41,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:41,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:41,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:41,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:41,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:41,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:41,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:41,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:41,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:41,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:41,002 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-02-08 05:37:41,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:41,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:41,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:41,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:41,243 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:41,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-02-08 05:37:42,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a197ac8/76a36bf79f6e488f9139d63d39e639e9/FLAG92758c3a5 [2025-02-08 05:37:42,840 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:42,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-02-08 05:37:42,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a197ac8/76a36bf79f6e488f9139d63d39e639e9/FLAG92758c3a5 [2025-02-08 05:37:42,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a197ac8/76a36bf79f6e488f9139d63d39e639e9 [2025-02-08 05:37:42,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:42,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:42,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:42,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:42,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:42,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:42" (1/1) ... [2025-02-08 05:37:42,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafcea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:42, skipping insertion in model container [2025-02-08 05:37:42,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:42" (1/1) ... [2025-02-08 05:37:42,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:43,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:43,057 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:43,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:43,108 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:43,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43 WrapperNode [2025-02-08 05:37:43,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:43,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:43,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:43,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:43,114 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:37:43" (1/1) ... [2025-02-08 05:37:43,122 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:37:43" (1/1) ... [2025-02-08 05:37:43,151 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 585 [2025-02-08 05:37:43,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:43,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:43,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:43,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:43,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:43,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:43,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:43,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:43,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:43,201 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:37:43,208 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:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:43,227 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:37:43,321 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:43,322 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:43,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:43,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647; [2025-02-08 05:37:43,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:43,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:43,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-11: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:43,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-7: #t~ite51#1 := #t~ret50#1; [2025-02-08 05:37:43,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret50#1 && #t~ret50#1 <= 2147483647; [2025-02-08 05:37:43,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:43,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:43,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-11: #t~ret50#1 := minus_#res#1; [2025-02-08 05:37:43,889 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:43,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:43,922 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:43,926 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:43,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:43 BoogieIcfgContainer [2025-02-08 05:37:43,926 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:43,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:43,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:43,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:43,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:42" (1/3) ... [2025-02-08 05:37:43,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d22aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:43, skipping insertion in model container [2025-02-08 05:37:43,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43" (2/3) ... [2025-02-08 05:37:43,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d22aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:43, skipping insertion in model container [2025-02-08 05:37:43,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:43" (3/3) ... [2025-02-08 05:37:43,937 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-02-08 05:37:43,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:43,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 726 locations, 1 initial locations, 3 loop locations, and 102 error locations. [2025-02-08 05:37:43,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:44,134 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:44,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 732 places, 763 transitions, 1540 flow [2025-02-08 05:37:44,419 INFO L124 PetriNetUnfolderBase]: 38/761 cut-off events. [2025-02-08 05:37:44,421 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 761 events. 38/761 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2041 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 554. Up to 2 conditions per place. [2025-02-08 05:37:44,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 732 places, 763 transitions, 1540 flow [2025-02-08 05:37:44,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 710 places, 739 transitions, 1490 flow [2025-02-08 05:37:44,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:44,460 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;@3f4664f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:44,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2025-02-08 05:37:44,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:44,464 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-02-08 05:37:44,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:44,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:44,465 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] [2025-02-08 05:37:44,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -330396794, now seen corresponding path program 1 times [2025-02-08 05:37:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-08 05:37:44,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:44,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:37:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:37:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:44,584 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:37:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-08 05:37:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145842649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396422958] [2025-02-08 05:37:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:44,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:44,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:44,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:44,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:44,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 739 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:44,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:44,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:44,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:45,145 INFO L124 PetriNetUnfolderBase]: 125/2362 cut-off events. [2025-02-08 05:37:45,145 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-02-08 05:37:45,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 2362 events. 125/2362 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14865 event pairs, 35 based on Foata normal form. 65/1930 useless extension candidates. Maximal degree in co-relation 2005. Up to 88 conditions per place. [2025-02-08 05:37:45,163 INFO L140 encePairwiseOnDemand]: 748/763 looper letters, 17 selfloop transitions, 2 changer transitions 2/726 dead transitions. [2025-02-08 05:37:45,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 726 transitions, 1502 flow [2025-02-08 05:37:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2025-02-08 05:37:45,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681083442551333 [2025-02-08 05:37:45,186 INFO L175 Difference]: Start difference. First operand has 710 places, 739 transitions, 1490 flow. Second operand 3 states and 2216 transitions. [2025-02-08 05:37:45,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 726 transitions, 1502 flow [2025-02-08 05:37:45,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 726 transitions, 1494 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:45,218 INFO L231 Difference]: Finished difference. Result has 707 places, 724 transitions, 1456 flow [2025-02-08 05:37:45,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=707, PETRI_TRANSITIONS=724} [2025-02-08 05:37:45,235 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -3 predicate places. [2025-02-08 05:37:45,235 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 724 transitions, 1456 flow [2025-02-08 05:37:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:45,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:45,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] [2025-02-08 05:37:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:45,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1484080362, now seen corresponding path program 1 times [2025-02-08 05:37:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-02-08 05:37:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:45,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:37:45,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:37:45,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:45,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:45,306 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:37:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611311485] [2025-02-08 05:37:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611311485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:45,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123371132] [2025-02-08 05:37:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:45,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:45,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:45,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:45,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 724 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:45,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:45,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:45,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:45,775 INFO L124 PetriNetUnfolderBase]: 125/2362 cut-off events. [2025-02-08 05:37:45,775 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-08 05:37:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 2362 events. 125/2362 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14456 event pairs, 35 based on Foata normal form. 0/1862 useless extension candidates. Maximal degree in co-relation 2427. Up to 88 conditions per place. [2025-02-08 05:37:45,793 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 17 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2025-02-08 05:37:45,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 723 transitions, 1492 flow [2025-02-08 05:37:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2204 transitions. [2025-02-08 05:37:45,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962865880297073 [2025-02-08 05:37:45,801 INFO L175 Difference]: Start difference. First operand has 707 places, 724 transitions, 1456 flow. Second operand 3 states and 2204 transitions. [2025-02-08 05:37:45,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 723 transitions, 1492 flow [2025-02-08 05:37:45,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 723 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:45,810 INFO L231 Difference]: Finished difference. Result has 704 places, 723 transitions, 1454 flow [2025-02-08 05:37:45,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=704, PETRI_TRANSITIONS=723} [2025-02-08 05:37:45,811 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -6 predicate places. [2025-02-08 05:37:45,811 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 723 transitions, 1454 flow [2025-02-08 05:37:45,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:45,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:45,813 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] [2025-02-08 05:37:45,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:45,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:45,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 4190453, now seen corresponding path program 1 times [2025-02-08 05:37:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:45,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879977873] [2025-02-08 05:37:45,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:45,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:37:45,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:37:45,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:45,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:45,860 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:37:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879977873] [2025-02-08 05:37:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879977873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608662232] [2025-02-08 05:37:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:45,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:45,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:45,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:45,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:45,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:45,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:45,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:46,223 INFO L124 PetriNetUnfolderBase]: 120/2890 cut-off events. [2025-02-08 05:37:46,224 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:46,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 2890 events. 120/2890 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17571 event pairs, 8 based on Foata normal form. 0/2279 useless extension candidates. Maximal degree in co-relation 2896. Up to 34 conditions per place. [2025-02-08 05:37:46,241 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 17 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2025-02-08 05:37:46,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 722 transitions, 1490 flow [2025-02-08 05:37:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2204 transitions. [2025-02-08 05:37:46,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962865880297073 [2025-02-08 05:37:46,245 INFO L175 Difference]: Start difference. First operand has 704 places, 723 transitions, 1454 flow. Second operand 3 states and 2204 transitions. [2025-02-08 05:37:46,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 722 transitions, 1490 flow [2025-02-08 05:37:46,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 722 transitions, 1486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:46,252 INFO L231 Difference]: Finished difference. Result has 703 places, 722 transitions, 1452 flow [2025-02-08 05:37:46,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=703, PETRI_TRANSITIONS=722} [2025-02-08 05:37:46,254 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -7 predicate places. [2025-02-08 05:37:46,254 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 722 transitions, 1452 flow [2025-02-08 05:37:46,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:46,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:46,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:46,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:46,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1243406365, now seen corresponding path program 1 times [2025-02-08 05:37:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440678575] [2025-02-08 05:37:46,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:46,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:46,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:37:46,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:37:46,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:46,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:46,285 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:37:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440678575] [2025-02-08 05:37:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440678575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951632] [2025-02-08 05:37:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:46,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:46,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:46,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 763 [2025-02-08 05:37:46,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:37:46,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:46,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 763 [2025-02-08 05:37:46,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:46,433 INFO L124 PetriNetUnfolderBase]: 41/991 cut-off events. [2025-02-08 05:37:46,433 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:46,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 991 events. 41/991 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3840 event pairs, 6 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 979. Up to 26 conditions per place. [2025-02-08 05:37:46,446 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2025-02-08 05:37:46,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 721 transitions, 1480 flow [2025-02-08 05:37:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2212 transitions. [2025-02-08 05:37:46,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663608562691132 [2025-02-08 05:37:46,450 INFO L175 Difference]: Start difference. First operand has 703 places, 722 transitions, 1452 flow. Second operand 3 states and 2212 transitions. [2025-02-08 05:37:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 721 transitions, 1480 flow [2025-02-08 05:37:46,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 721 transitions, 1476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:46,457 INFO L231 Difference]: Finished difference. Result has 702 places, 721 transitions, 1450 flow [2025-02-08 05:37:46,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=702, PETRI_TRANSITIONS=721} [2025-02-08 05:37:46,459 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -8 predicate places. [2025-02-08 05:37:46,459 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 721 transitions, 1450 flow [2025-02-08 05:37:46,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:37:46,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:46,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:46,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:46,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2033972611, now seen corresponding path program 1 times [2025-02-08 05:37:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-02-08 05:37:46,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:46,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:37:46,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:37:46,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:46,516 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:37:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-02-08 05:37:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135572453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:46,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180181491] [2025-02-08 05:37:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:46,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:46,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:46,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 763 [2025-02-08 05:37:46,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:37:46,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:46,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 763 [2025-02-08 05:37:46,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:46,783 INFO L124 PetriNetUnfolderBase]: 84/2075 cut-off events. [2025-02-08 05:37:46,784 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:37:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 2075 events. 84/2075 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10372 event pairs, 5 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 2051. Up to 23 conditions per place. [2025-02-08 05:37:46,805 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 12 selfloop transitions, 2 changer transitions 0/720 dead transitions. [2025-02-08 05:37:46,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 720 transitions, 1476 flow [2025-02-08 05:37:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2025-02-08 05:37:46,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672346002621232 [2025-02-08 05:37:46,810 INFO L175 Difference]: Start difference. First operand has 702 places, 721 transitions, 1450 flow. Second operand 3 states and 2214 transitions. [2025-02-08 05:37:46,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 720 transitions, 1476 flow [2025-02-08 05:37:46,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 720 transitions, 1472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:46,823 INFO L231 Difference]: Finished difference. Result has 701 places, 720 transitions, 1448 flow [2025-02-08 05:37:46,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=701, PETRI_TRANSITIONS=720} [2025-02-08 05:37:46,827 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -9 predicate places. [2025-02-08 05:37:46,827 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 720 transitions, 1448 flow [2025-02-08 05:37:46,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:37:46,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:46,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:46,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:46,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:46,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1247763520, now seen corresponding path program 1 times [2025-02-08 05:37:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871948996] [2025-02-08 05:37:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:37:46,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:37:46,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:46,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:46,899 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:37:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871948996] [2025-02-08 05:37:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871948996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:46,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:46,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94521337] [2025-02-08 05:37:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:46,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:46,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:46,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:46,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 763 [2025-02-08 05:37:46,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 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:37:46,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:46,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 763 [2025-02-08 05:37:46,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:47,469 INFO L124 PetriNetUnfolderBase]: 168/3971 cut-off events. [2025-02-08 05:37:47,469 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:47,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 3971 events. 168/3971 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 27506 event pairs, 12 based on Foata normal form. 0/3124 useless extension candidates. Maximal degree in co-relation 3967. Up to 44 conditions per place. [2025-02-08 05:37:47,493 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 19 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2025-02-08 05:37:47,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 719 transitions, 1488 flow [2025-02-08 05:37:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2200 transitions. [2025-02-08 05:37:47,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611183923110529 [2025-02-08 05:37:47,496 INFO L175 Difference]: Start difference. First operand has 701 places, 720 transitions, 1448 flow. Second operand 3 states and 2200 transitions. [2025-02-08 05:37:47,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 719 transitions, 1488 flow [2025-02-08 05:37:47,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 719 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:47,558 INFO L231 Difference]: Finished difference. Result has 700 places, 719 transitions, 1446 flow [2025-02-08 05:37:47,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1446, PETRI_PLACES=700, PETRI_TRANSITIONS=719} [2025-02-08 05:37:47,559 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -10 predicate places. [2025-02-08 05:37:47,559 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 719 transitions, 1446 flow [2025-02-08 05:37:47,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 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:37:47,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:47,560 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] [2025-02-08 05:37:47,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:47,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:47,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 980612543, now seen corresponding path program 1 times [2025-02-08 05:37:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-02-08 05:37:47,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:47,592 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:37:47,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:47,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559120703] [2025-02-08 05:37:47,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559120703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:47,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:47,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725581647] [2025-02-08 05:37:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:47,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:47,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:47,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 719 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:47,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:47,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:47,735 INFO L124 PetriNetUnfolderBase]: 43/972 cut-off events. [2025-02-08 05:37:47,735 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-02-08 05:37:47,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 972 events. 43/972 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3706 event pairs, 8 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 939. Up to 35 conditions per place. [2025-02-08 05:37:47,747 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 17 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2025-02-08 05:37:47,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 718 transitions, 1482 flow [2025-02-08 05:37:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2204 transitions. [2025-02-08 05:37:47,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962865880297073 [2025-02-08 05:37:47,750 INFO L175 Difference]: Start difference. First operand has 700 places, 719 transitions, 1446 flow. Second operand 3 states and 2204 transitions. [2025-02-08 05:37:47,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 718 transitions, 1482 flow [2025-02-08 05:37:47,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 718 transitions, 1478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:47,757 INFO L231 Difference]: Finished difference. Result has 699 places, 718 transitions, 1444 flow [2025-02-08 05:37:47,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=699, PETRI_TRANSITIONS=718} [2025-02-08 05:37:47,758 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -11 predicate places. [2025-02-08 05:37:47,758 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 718 transitions, 1444 flow [2025-02-08 05:37:47,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.3333333333334) internal successors, (2188), 3 states have internal predecessors, (2188), 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:37:47,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:47,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:47,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:47,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:47,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2124902435, now seen corresponding path program 1 times [2025-02-08 05:37:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141247966] [2025-02-08 05:37:47,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:37:47,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:37:47,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:47,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:47,818 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:37:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141247966] [2025-02-08 05:37:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141247966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:47,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437573545] [2025-02-08 05:37:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:47,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:47,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 763 [2025-02-08 05:37:47,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 718 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:37:47,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 763 [2025-02-08 05:37:47,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,072 INFO L124 PetriNetUnfolderBase]: 41/987 cut-off events. [2025-02-08 05:37:48,075 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-08 05:37:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 987 events. 41/987 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3530 event pairs, 6 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 937. Up to 26 conditions per place. [2025-02-08 05:37:48,101 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 13 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2025-02-08 05:37:48,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 717 transitions, 1472 flow [2025-02-08 05:37:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2212 transitions. [2025-02-08 05:37:48,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663608562691132 [2025-02-08 05:37:48,105 INFO L175 Difference]: Start difference. First operand has 699 places, 718 transitions, 1444 flow. Second operand 3 states and 2212 transitions. [2025-02-08 05:37:48,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 717 transitions, 1472 flow [2025-02-08 05:37:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 717 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:48,124 INFO L231 Difference]: Finished difference. Result has 698 places, 717 transitions, 1442 flow [2025-02-08 05:37:48,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=698, PETRI_TRANSITIONS=717} [2025-02-08 05:37:48,125 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -12 predicate places. [2025-02-08 05:37:48,125 INFO L471 AbstractCegarLoop]: Abstraction has has 698 places, 717 transitions, 1442 flow [2025-02-08 05:37:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:37:48,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,126 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] [2025-02-08 05:37:48,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:48,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1231277435, now seen corresponding path program 1 times [2025-02-08 05:37:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294846325] [2025-02-08 05:37:48,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:37:48,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:37:48,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,186 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:37:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294846325] [2025-02-08 05:37:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294846325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092433333] [2025-02-08 05:37:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 763 [2025-02-08 05:37:48,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 717 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:37:48,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 763 [2025-02-08 05:37:48,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,320 INFO L124 PetriNetUnfolderBase]: 29/726 cut-off events. [2025-02-08 05:37:48,320 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:37:48,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 726 events. 29/726 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2437 event pairs, 5 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 665. Up to 23 conditions per place. [2025-02-08 05:37:48,348 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 12 selfloop transitions, 2 changer transitions 0/716 dead transitions. [2025-02-08 05:37:48,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 716 transitions, 1468 flow [2025-02-08 05:37:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2025-02-08 05:37:48,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672346002621232 [2025-02-08 05:37:48,352 INFO L175 Difference]: Start difference. First operand has 698 places, 717 transitions, 1442 flow. Second operand 3 states and 2214 transitions. [2025-02-08 05:37:48,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 716 transitions, 1468 flow [2025-02-08 05:37:48,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 716 transitions, 1464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:48,359 INFO L231 Difference]: Finished difference. Result has 697 places, 716 transitions, 1440 flow [2025-02-08 05:37:48,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=697, PETRI_TRANSITIONS=716} [2025-02-08 05:37:48,360 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -13 predicate places. [2025-02-08 05:37:48,360 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 716 transitions, 1440 flow [2025-02-08 05:37:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:37:48,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,361 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] [2025-02-08 05:37:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:48,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 596111455, now seen corresponding path program 1 times [2025-02-08 05:37:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666509648] [2025-02-08 05:37:48,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:37:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:37:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,386 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:37:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666509648] [2025-02-08 05:37:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666509648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891457438] [2025-02-08 05:37:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 763 [2025-02-08 05:37:48,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 716 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 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:37:48,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 763 [2025-02-08 05:37:48,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,524 INFO L124 PetriNetUnfolderBase]: 47/985 cut-off events. [2025-02-08 05:37:48,524 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-08 05:37:48,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 985 events. 47/985 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4027 event pairs, 12 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 937. Up to 44 conditions per place. [2025-02-08 05:37:48,536 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 19 selfloop transitions, 2 changer transitions 0/715 dead transitions. [2025-02-08 05:37:48,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 715 transitions, 1480 flow [2025-02-08 05:37:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2200 transitions. [2025-02-08 05:37:48,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611183923110529 [2025-02-08 05:37:48,539 INFO L175 Difference]: Start difference. First operand has 697 places, 716 transitions, 1440 flow. Second operand 3 states and 2200 transitions. [2025-02-08 05:37:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 715 transitions, 1480 flow [2025-02-08 05:37:48,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 715 transitions, 1476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:48,546 INFO L231 Difference]: Finished difference. Result has 696 places, 715 transitions, 1438 flow [2025-02-08 05:37:48,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=696, PETRI_TRANSITIONS=715} [2025-02-08 05:37:48,548 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -14 predicate places. [2025-02-08 05:37:48,548 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 715 transitions, 1438 flow [2025-02-08 05:37:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.3333333333334) internal successors, (2182), 3 states have internal predecessors, (2182), 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:37:48,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,549 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] [2025-02-08 05:37:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:48,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -201414255, now seen corresponding path program 1 times [2025-02-08 05:37:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825312554] [2025-02-08 05:37:48,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:37:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:37:48,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,608 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:37:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825312554] [2025-02-08 05:37:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825312554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319617972] [2025-02-08 05:37:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 763 [2025-02-08 05:37:48,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 715 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:37:48,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 763 [2025-02-08 05:37:48,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,734 INFO L124 PetriNetUnfolderBase]: 48/1203 cut-off events. [2025-02-08 05:37:48,734 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:48,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 1203 events. 48/1203 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4201 event pairs, 3 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 1122. Up to 18 conditions per place. [2025-02-08 05:37:48,749 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 9 selfloop transitions, 2 changer transitions 0/714 dead transitions. [2025-02-08 05:37:48,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 714 transitions, 1458 flow [2025-02-08 05:37:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2025-02-08 05:37:48,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698558322411533 [2025-02-08 05:37:48,753 INFO L175 Difference]: Start difference. First operand has 696 places, 715 transitions, 1438 flow. Second operand 3 states and 2220 transitions. [2025-02-08 05:37:48,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 714 transitions, 1458 flow [2025-02-08 05:37:48,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 714 transitions, 1454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:48,760 INFO L231 Difference]: Finished difference. Result has 695 places, 714 transitions, 1436 flow [2025-02-08 05:37:48,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=695, PETRI_TRANSITIONS=714} [2025-02-08 05:37:48,762 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -15 predicate places. [2025-02-08 05:37:48,762 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 714 transitions, 1436 flow [2025-02-08 05:37:48,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:37:48,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,763 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] [2025-02-08 05:37:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:48,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -895079923, now seen corresponding path program 1 times [2025-02-08 05:37:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229692842] [2025-02-08 05:37:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:37:48,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:37:48,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,226 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:37:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229692842] [2025-02-08 05:37:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229692842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150275916] [2025-02-08 05:37:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:49,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:49,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 763 [2025-02-08 05:37:49,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 714 transitions, 1436 flow. Second operand has 6 states, 6 states have (on average 724.5) internal successors, (4347), 6 states have internal predecessors, (4347), 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:37:49,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 763 [2025-02-08 05:37:49,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,565 INFO L124 PetriNetUnfolderBase]: 122/2301 cut-off events. [2025-02-08 05:37:49,566 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-08 05:37:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 2301 events. 122/2301 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 12912 event pairs, 24 based on Foata normal form. 0/1824 useless extension candidates. Maximal degree in co-relation 2233. Up to 84 conditions per place. [2025-02-08 05:37:49,590 INFO L140 encePairwiseOnDemand]: 757/763 looper letters, 20 selfloop transitions, 5 changer transitions 0/713 dead transitions. [2025-02-08 05:37:49,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 713 transitions, 1484 flow [2025-02-08 05:37:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4364 transitions. [2025-02-08 05:37:49,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532546963739624 [2025-02-08 05:37:49,596 INFO L175 Difference]: Start difference. First operand has 695 places, 714 transitions, 1436 flow. Second operand 6 states and 4364 transitions. [2025-02-08 05:37:49,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 713 transitions, 1484 flow [2025-02-08 05:37:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 713 transitions, 1480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:49,604 INFO L231 Difference]: Finished difference. Result has 697 places, 713 transitions, 1440 flow [2025-02-08 05:37:49,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=697, PETRI_TRANSITIONS=713} [2025-02-08 05:37:49,605 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -13 predicate places. [2025-02-08 05:37:49,605 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 713 transitions, 1440 flow [2025-02-08 05:37:49,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 724.5) internal successors, (4347), 6 states have internal predecessors, (4347), 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:37:49,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,607 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] [2025-02-08 05:37:49,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:49,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -349583188, now seen corresponding path program 1 times [2025-02-08 05:37:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009756322] [2025-02-08 05:37:49,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:37:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:37:49,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,644 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:37:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009756322] [2025-02-08 05:37:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009756322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834898376] [2025-02-08 05:37:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 763 [2025-02-08 05:37:49,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 713 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 735.6666666666666) internal successors, (2207), 3 states have internal predecessors, (2207), 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:37:49,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 763 [2025-02-08 05:37:49,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,839 INFO L124 PetriNetUnfolderBase]: 55/1254 cut-off events. [2025-02-08 05:37:49,839 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2025-02-08 05:37:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1254 events. 55/1254 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5791 event pairs, 2 based on Foata normal form. 1/1014 useless extension candidates. Maximal degree in co-relation 1287. Up to 27 conditions per place. [2025-02-08 05:37:49,855 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 13 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2025-02-08 05:37:49,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 713 transitions, 1471 flow [2025-02-08 05:37:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2025-02-08 05:37:49,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689820882481432 [2025-02-08 05:37:49,860 INFO L175 Difference]: Start difference. First operand has 697 places, 713 transitions, 1440 flow. Second operand 3 states and 2218 transitions. [2025-02-08 05:37:49,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 713 transitions, 1471 flow [2025-02-08 05:37:49,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 713 transitions, 1461 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:49,870 INFO L231 Difference]: Finished difference. Result has 693 places, 712 transitions, 1432 flow [2025-02-08 05:37:49,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=693, PETRI_TRANSITIONS=712} [2025-02-08 05:37:49,872 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -17 predicate places. [2025-02-08 05:37:49,872 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 712 transitions, 1432 flow [2025-02-08 05:37:49,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.6666666666666) internal successors, (2207), 3 states have internal predecessors, (2207), 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:37:49,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,873 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] [2025-02-08 05:37:49,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:49,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:49,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1796811644, now seen corresponding path program 1 times [2025-02-08 05:37:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-02-08 05:37:49,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:37:49,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:37:49,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,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:37:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695178003] [2025-02-08 05:37:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695178003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677351586] [2025-02-08 05:37:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:49,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 712 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 729.6666666666666) internal successors, (2189), 3 states have internal predecessors, (2189), 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:37:49,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,154 INFO L124 PetriNetUnfolderBase]: 61/1253 cut-off events. [2025-02-08 05:37:50,155 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2025-02-08 05:37:50,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1253 events. 61/1253 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5836 event pairs, 13 based on Foata normal form. 1/1016 useless extension candidates. Maximal degree in co-relation 1158. Up to 45 conditions per place. [2025-02-08 05:37:50,174 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 19 selfloop transitions, 2 changer transitions 0/712 dead transitions. [2025-02-08 05:37:50,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 712 transitions, 1475 flow [2025-02-08 05:37:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2025-02-08 05:37:50,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963739624290083 [2025-02-08 05:37:50,178 INFO L175 Difference]: Start difference. First operand has 693 places, 712 transitions, 1432 flow. Second operand 3 states and 2206 transitions. [2025-02-08 05:37:50,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 712 transitions, 1475 flow [2025-02-08 05:37:50,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 712 transitions, 1471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,189 INFO L231 Difference]: Finished difference. Result has 692 places, 711 transitions, 1430 flow [2025-02-08 05:37:50,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=692, PETRI_TRANSITIONS=711} [2025-02-08 05:37:50,190 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -18 predicate places. [2025-02-08 05:37:50,190 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 711 transitions, 1430 flow [2025-02-08 05:37:50,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 729.6666666666666) internal successors, (2189), 3 states have internal predecessors, (2189), 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:37:50,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,192 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] [2025-02-08 05:37:50,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:50,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:50,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash -189119135, now seen corresponding path program 1 times [2025-02-08 05:37:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450173593] [2025-02-08 05:37:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:37:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:37:50,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,234 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:37:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450173593] [2025-02-08 05:37:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450173593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43596406] [2025-02-08 05:37:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 763 [2025-02-08 05:37:50,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 711 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 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:37:50,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 763 [2025-02-08 05:37:50,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,376 INFO L124 PetriNetUnfolderBase]: 44/983 cut-off events. [2025-02-08 05:37:50,377 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-08 05:37:50,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 983 events. 44/983 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3527 event pairs, 7 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 850. Up to 27 conditions per place. [2025-02-08 05:37:50,392 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 13 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2025-02-08 05:37:50,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 711 transitions, 1461 flow [2025-02-08 05:37:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2025-02-08 05:37:50,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689820882481432 [2025-02-08 05:37:50,396 INFO L175 Difference]: Start difference. First operand has 692 places, 711 transitions, 1430 flow. Second operand 3 states and 2218 transitions. [2025-02-08 05:37:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 711 transitions, 1461 flow [2025-02-08 05:37:50,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 711 transitions, 1457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,404 INFO L231 Difference]: Finished difference. Result has 691 places, 710 transitions, 1428 flow [2025-02-08 05:37:50,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=691, PETRI_TRANSITIONS=710} [2025-02-08 05:37:50,405 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -19 predicate places. [2025-02-08 05:37:50,405 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 710 transitions, 1428 flow [2025-02-08 05:37:50,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 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:37:50,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,406 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] [2025-02-08 05:37:50,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:50,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,407 INFO L85 PathProgramCache]: Analyzing trace with hash 639781777, now seen corresponding path program 1 times [2025-02-08 05:37:50,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752309776] [2025-02-08 05:37:50,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:37:50,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:37:50,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,437 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:37:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752309776] [2025-02-08 05:37:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752309776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790433615] [2025-02-08 05:37:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 763 [2025-02-08 05:37:50,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 710 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 715.3333333333334) internal successors, (2146), 3 states have internal predecessors, (2146), 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:37:50,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 763 [2025-02-08 05:37:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,927 INFO L124 PetriNetUnfolderBase]: 364/5241 cut-off events. [2025-02-08 05:37:50,927 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:37:50,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5556 conditions, 5241 events. 364/5241 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 39953 event pairs, 100 based on Foata normal form. 0/4172 useless extension candidates. Maximal degree in co-relation 5092. Up to 295 conditions per place. [2025-02-08 05:37:50,955 INFO L140 encePairwiseOnDemand]: 751/763 looper letters, 26 selfloop transitions, 2 changer transitions 0/703 dead transitions. [2025-02-08 05:37:50,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 703 transitions, 1471 flow [2025-02-08 05:37:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2180 transitions. [2025-02-08 05:37:50,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-08 05:37:50,959 INFO L175 Difference]: Start difference. First operand has 691 places, 710 transitions, 1428 flow. Second operand 3 states and 2180 transitions. [2025-02-08 05:37:50,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 703 transitions, 1471 flow [2025-02-08 05:37:50,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 703 transitions, 1467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,968 INFO L231 Difference]: Finished difference. Result has 682 places, 702 transitions, 1418 flow [2025-02-08 05:37:50,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=682, PETRI_TRANSITIONS=702} [2025-02-08 05:37:50,969 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -28 predicate places. [2025-02-08 05:37:50,969 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 702 transitions, 1418 flow [2025-02-08 05:37:50,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 715.3333333333334) internal successors, (2146), 3 states have internal predecessors, (2146), 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:37:50,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,970 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] [2025-02-08 05:37:50,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:50,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:50,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,971 INFO L85 PathProgramCache]: Analyzing trace with hash 650013010, now seen corresponding path program 1 times [2025-02-08 05:37:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-02-08 05:37:50,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:37:50,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:37:50,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,005 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:37:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-02-08 05:37:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502997662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365832504] [2025-02-08 05:37:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 763 [2025-02-08 05:37:51,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 702 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 715.3333333333334) internal successors, (2146), 3 states have internal predecessors, (2146), 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:37:51,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 763 [2025-02-08 05:37:51,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,526 INFO L124 PetriNetUnfolderBase]: 375/5427 cut-off events. [2025-02-08 05:37:51,526 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:37:51,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5427 events. 375/5427 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 42202 event pairs, 100 based on Foata normal form. 0/4388 useless extension candidates. Maximal degree in co-relation 5327. Up to 300 conditions per place. [2025-02-08 05:37:51,549 INFO L140 encePairwiseOnDemand]: 751/763 looper letters, 26 selfloop transitions, 2 changer transitions 0/695 dead transitions. [2025-02-08 05:37:51,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 695 transitions, 1461 flow [2025-02-08 05:37:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2180 transitions. [2025-02-08 05:37:51,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-08 05:37:51,552 INFO L175 Difference]: Start difference. First operand has 682 places, 702 transitions, 1418 flow. Second operand 3 states and 2180 transitions. [2025-02-08 05:37:51,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 695 transitions, 1461 flow [2025-02-08 05:37:51,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 695 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:51,559 INFO L231 Difference]: Finished difference. Result has 675 places, 694 transitions, 1412 flow [2025-02-08 05:37:51,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1412, PETRI_PLACES=675, PETRI_TRANSITIONS=694} [2025-02-08 05:37:51,560 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -35 predicate places. [2025-02-08 05:37:51,560 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 694 transitions, 1412 flow [2025-02-08 05:37:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 715.3333333333334) internal successors, (2146), 3 states have internal predecessors, (2146), 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:37:51,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:51,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:51,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1194584841, now seen corresponding path program 1 times [2025-02-08 05:37:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-02-08 05:37:51,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:37:51,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:37:51,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,592 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:37:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-02-08 05:37:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555228730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85827516] [2025-02-08 05:37:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:51,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 694 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 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:37:51,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,776 INFO L124 PetriNetUnfolderBase]: 74/1440 cut-off events. [2025-02-08 05:37:51,777 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-02-08 05:37:51,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1440 events. 74/1440 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7553 event pairs, 13 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1102. Up to 67 conditions per place. [2025-02-08 05:37:51,791 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 19 selfloop transitions, 2 changer transitions 0/694 dead transitions. [2025-02-08 05:37:51,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 694 transitions, 1455 flow [2025-02-08 05:37:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2025-02-08 05:37:51,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963739624290083 [2025-02-08 05:37:51,794 INFO L175 Difference]: Start difference. First operand has 675 places, 694 transitions, 1412 flow. Second operand 3 states and 2206 transitions. [2025-02-08 05:37:51,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 694 transitions, 1455 flow [2025-02-08 05:37:51,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 694 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:51,803 INFO L231 Difference]: Finished difference. Result has 676 places, 693 transitions, 1414 flow [2025-02-08 05:37:51,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=676, PETRI_TRANSITIONS=693} [2025-02-08 05:37:51,804 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -34 predicate places. [2025-02-08 05:37:51,804 INFO L471 AbstractCegarLoop]: Abstraction has has 676 places, 693 transitions, 1414 flow [2025-02-08 05:37:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 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:37:51,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,805 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] [2025-02-08 05:37:51,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:51,805 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1468443356, now seen corresponding path program 1 times [2025-02-08 05:37:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-08 05:37:51,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-08 05:37:51,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-08 05:37:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,835 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:37:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-08 05:37:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671499279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653585032] [2025-02-08 05:37:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 763 [2025-02-08 05:37:51,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 693 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 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:37:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 763 [2025-02-08 05:37:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,050 INFO L124 PetriNetUnfolderBase]: 107/2247 cut-off events. [2025-02-08 05:37:52,050 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:37:52,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 2247 events. 107/2247 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12151 event pairs, 4 based on Foata normal form. 0/1865 useless extension candidates. Maximal degree in co-relation 1927. Up to 28 conditions per place. [2025-02-08 05:37:52,066 INFO L140 encePairwiseOnDemand]: 748/763 looper letters, 16 selfloop transitions, 9 changer transitions 0/691 dead transitions. [2025-02-08 05:37:52,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 691 transitions, 1461 flow [2025-02-08 05:37:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2197 transitions. [2025-02-08 05:37:52,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9598077763215378 [2025-02-08 05:37:52,069 INFO L175 Difference]: Start difference. First operand has 676 places, 693 transitions, 1414 flow. Second operand 3 states and 2197 transitions. [2025-02-08 05:37:52,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 691 transitions, 1461 flow [2025-02-08 05:37:52,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 691 transitions, 1457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,077 INFO L231 Difference]: Finished difference. Result has 671 places, 690 transitions, 1437 flow [2025-02-08 05:37:52,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=671, PETRI_TRANSITIONS=690} [2025-02-08 05:37:52,078 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -39 predicate places. [2025-02-08 05:37:52,078 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 690 transitions, 1437 flow [2025-02-08 05:37:52,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 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:37:52,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,078 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] [2025-02-08 05:37:52,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:52,079 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:52,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2112795352, now seen corresponding path program 1 times [2025-02-08 05:37:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623067568] [2025-02-08 05:37:52,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:37:52,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:37:52,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,109 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:37:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623067568] [2025-02-08 05:37:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623067568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122939266] [2025-02-08 05:37:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:37:52,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 690 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 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:37:52,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:37:52,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,331 INFO L124 PetriNetUnfolderBase]: 104/2199 cut-off events. [2025-02-08 05:37:52,331 INFO L125 PetriNetUnfolderBase]: For 39/47 co-relation queries the response was YES. [2025-02-08 05:37:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 2199 events. 104/2199 cut-off events. For 39/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14006 event pairs, 10 based on Foata normal form. 1/1830 useless extension candidates. Maximal degree in co-relation 1896. Up to 42 conditions per place. [2025-02-08 05:37:52,349 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 19 selfloop transitions, 3 changer transitions 0/690 dead transitions. [2025-02-08 05:37:52,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 690 transitions, 1482 flow [2025-02-08 05:37:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2025-02-08 05:37:52,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654871122761031 [2025-02-08 05:37:52,352 INFO L175 Difference]: Start difference. First operand has 671 places, 690 transitions, 1437 flow. Second operand 3 states and 2210 transitions. [2025-02-08 05:37:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 690 transitions, 1482 flow [2025-02-08 05:37:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 690 transitions, 1473 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:52,359 INFO L231 Difference]: Finished difference. Result has 671 places, 689 transitions, 1432 flow [2025-02-08 05:37:52,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=671, PETRI_TRANSITIONS=689} [2025-02-08 05:37:52,360 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -39 predicate places. [2025-02-08 05:37:52,361 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 689 transitions, 1432 flow [2025-02-08 05:37:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 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:37:52,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,361 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] [2025-02-08 05:37:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:52,362 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 496114591, now seen corresponding path program 1 times [2025-02-08 05:37:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666407497] [2025-02-08 05:37:52,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 05:37:52,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 05:37:52,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,391 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:37:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666407497] [2025-02-08 05:37:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666407497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562401806] [2025-02-08 05:37:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 763 [2025-02-08 05:37:52,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 689 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 723.6666666666666) internal successors, (2171), 3 states have internal predecessors, (2171), 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:37:52,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 763 [2025-02-08 05:37:52,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,559 INFO L124 PetriNetUnfolderBase]: 71/1444 cut-off events. [2025-02-08 05:37:52,560 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-02-08 05:37:52,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 1444 events. 71/1444 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7494 event pairs, 4 based on Foata normal form. 1/1228 useless extension candidates. Maximal degree in co-relation 1118. Up to 43 conditions per place. [2025-02-08 05:37:52,573 INFO L140 encePairwiseOnDemand]: 748/763 looper letters, 12 selfloop transitions, 8 changer transitions 13/687 dead transitions. [2025-02-08 05:37:52,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 687 transitions, 1477 flow [2025-02-08 05:37:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2025-02-08 05:37:52,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9593709043250328 [2025-02-08 05:37:52,576 INFO L175 Difference]: Start difference. First operand has 671 places, 689 transitions, 1432 flow. Second operand 3 states and 2196 transitions. [2025-02-08 05:37:52,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 687 transitions, 1477 flow [2025-02-08 05:37:52,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 687 transitions, 1471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,583 INFO L231 Difference]: Finished difference. Result has 666 places, 673 transitions, 1421 flow [2025-02-08 05:37:52,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1421, PETRI_PLACES=666, PETRI_TRANSITIONS=673} [2025-02-08 05:37:52,584 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -44 predicate places. [2025-02-08 05:37:52,585 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 673 transitions, 1421 flow [2025-02-08 05:37:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.6666666666666) internal successors, (2171), 3 states have internal predecessors, (2171), 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:37:52,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,585 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] [2025-02-08 05:37:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:52,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 739521933, now seen corresponding path program 1 times [2025-02-08 05:37:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088201639] [2025-02-08 05:37:52,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:37:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:37:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,613 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:37:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088201639] [2025-02-08 05:37:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088201639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792760267] [2025-02-08 05:37:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:37:52,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 673 transitions, 1421 flow. Second operand has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:37:52,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:37:52,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,774 INFO L124 PetriNetUnfolderBase]: 70/1428 cut-off events. [2025-02-08 05:37:52,775 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-02-08 05:37:52,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1428 events. 70/1428 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7290 event pairs, 4 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1370. Up to 63 conditions per place. [2025-02-08 05:37:52,787 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2025-02-08 05:37:52,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 673 transitions, 1460 flow [2025-02-08 05:37:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:37:52,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:37:52,790 INFO L175 Difference]: Start difference. First operand has 666 places, 673 transitions, 1421 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:37:52,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 673 transitions, 1460 flow [2025-02-08 05:37:52,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 673 transitions, 1452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:52,797 INFO L231 Difference]: Finished difference. Result has 654 places, 672 transitions, 1417 flow [2025-02-08 05:37:52,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1417, PETRI_PLACES=654, PETRI_TRANSITIONS=672} [2025-02-08 05:37:52,798 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -56 predicate places. [2025-02-08 05:37:52,798 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 672 transitions, 1417 flow [2025-02-08 05:37:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:37:52,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:52,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:52,799 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -63682865, now seen corresponding path program 1 times [2025-02-08 05:37:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809371796] [2025-02-08 05:37:52,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:37:52,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:37:52,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,827 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:37:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809371796] [2025-02-08 05:37:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809371796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406217217] [2025-02-08 05:37:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 763 [2025-02-08 05:37:52,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 672 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 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:37:52,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 763 [2025-02-08 05:37:52,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,525 INFO L124 PetriNetUnfolderBase]: 208/4716 cut-off events. [2025-02-08 05:37:53,525 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2025-02-08 05:37:53,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 4716 events. 208/4716 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 39859 event pairs, 12 based on Foata normal form. 0/3939 useless extension candidates. Maximal degree in co-relation 4352. Up to 85 conditions per place. [2025-02-08 05:37:53,578 INFO L140 encePairwiseOnDemand]: 755/763 looper letters, 17 selfloop transitions, 4 changer transitions 0/678 dead transitions. [2025-02-08 05:37:53,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 678 transitions, 1473 flow [2025-02-08 05:37:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2224 transitions. [2025-02-08 05:37:53,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716033202271734 [2025-02-08 05:37:53,581 INFO L175 Difference]: Start difference. First operand has 654 places, 672 transitions, 1417 flow. Second operand 3 states and 2224 transitions. [2025-02-08 05:37:53,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 678 transitions, 1473 flow [2025-02-08 05:37:53,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 678 transitions, 1467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,588 INFO L231 Difference]: Finished difference. Result has 656 places, 676 transitions, 1451 flow [2025-02-08 05:37:53,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=656, PETRI_TRANSITIONS=676} [2025-02-08 05:37:53,589 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -54 predicate places. [2025-02-08 05:37:53,589 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 676 transitions, 1451 flow [2025-02-08 05:37:53,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 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:37:53,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,590 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] [2025-02-08 05:37:53,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:53,590 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:53,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash 917364108, now seen corresponding path program 1 times [2025-02-08 05:37:53,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-02-08 05:37:53,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:37:53,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:37:53,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,616 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:37:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549871659] [2025-02-08 05:37:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549871659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920296806] [2025-02-08 05:37:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 763 [2025-02-08 05:37:53,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 676 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 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:37:53,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 763 [2025-02-08 05:37:53,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,356 INFO L124 PetriNetUnfolderBase]: 293/6169 cut-off events. [2025-02-08 05:37:54,357 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 05:37:54,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6758 conditions, 6169 events. 293/6169 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 54039 event pairs, 15 based on Foata normal form. 0/5223 useless extension candidates. Maximal degree in co-relation 5555. Up to 138 conditions per place. [2025-02-08 05:37:54,407 INFO L140 encePairwiseOnDemand]: 746/763 looper letters, 20 selfloop transitions, 9 changer transitions 0/673 dead transitions. [2025-02-08 05:37:54,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 673 transitions, 1504 flow [2025-02-08 05:37:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2185 transitions. [2025-02-08 05:37:54,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545653123634775 [2025-02-08 05:37:54,411 INFO L175 Difference]: Start difference. First operand has 656 places, 676 transitions, 1451 flow. Second operand 3 states and 2185 transitions. [2025-02-08 05:37:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 673 transitions, 1504 flow [2025-02-08 05:37:54,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 673 transitions, 1500 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:54,419 INFO L231 Difference]: Finished difference. Result has 651 places, 672 transitions, 1483 flow [2025-02-08 05:37:54,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1483, PETRI_PLACES=651, PETRI_TRANSITIONS=672} [2025-02-08 05:37:54,420 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:37:54,420 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 672 transitions, 1483 flow [2025-02-08 05:37:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 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:37:54,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,421 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] [2025-02-08 05:37:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:54,421 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1171270369, now seen corresponding path program 1 times [2025-02-08 05:37:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125220015] [2025-02-08 05:37:54,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:37:54,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:37:54,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,449 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:37:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125220015] [2025-02-08 05:37:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125220015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130870248] [2025-02-08 05:37:54,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:54,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 672 transitions, 1483 flow. Second operand has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 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:37:54,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,289 INFO L124 PetriNetUnfolderBase]: 275/6068 cut-off events. [2025-02-08 05:37:55,290 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-02-08 05:37:55,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6710 conditions, 6068 events. 275/6068 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 57978 event pairs, 32 based on Foata normal form. 0/5117 useless extension candidates. Maximal degree in co-relation 5506. Up to 122 conditions per place. [2025-02-08 05:37:55,338 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 21 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-02-08 05:37:55,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 672 transitions, 1532 flow [2025-02-08 05:37:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:37:55,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:37:55,341 INFO L175 Difference]: Start difference. First operand has 651 places, 672 transitions, 1483 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:37:55,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 672 transitions, 1532 flow [2025-02-08 05:37:55,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 672 transitions, 1514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,348 INFO L231 Difference]: Finished difference. Result has 650 places, 671 transitions, 1469 flow [2025-02-08 05:37:55,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1469, PETRI_PLACES=650, PETRI_TRANSITIONS=671} [2025-02-08 05:37:55,350 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -60 predicate places. [2025-02-08 05:37:55,350 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 671 transitions, 1469 flow [2025-02-08 05:37:55,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 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:37:55,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,351 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] [2025-02-08 05:37:55,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:37:55,351 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 322346695, now seen corresponding path program 1 times [2025-02-08 05:37:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130919476] [2025-02-08 05:37:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:37:55,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:37:55,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,382 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:37:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130919476] [2025-02-08 05:37:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130919476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429085961] [2025-02-08 05:37:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 763 [2025-02-08 05:37:55,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 671 transitions, 1469 flow. Second operand has 3 states, 3 states have (on average 718.0) internal successors, (2154), 3 states have internal predecessors, (2154), 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:37:55,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 763 [2025-02-08 05:37:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,265 INFO L124 PetriNetUnfolderBase]: 300/5653 cut-off events. [2025-02-08 05:37:56,265 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2025-02-08 05:37:56,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 5653 events. 300/5653 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 54124 event pairs, 16 based on Foata normal form. 0/4833 useless extension candidates. Maximal degree in co-relation 5544. Up to 262 conditions per place. [2025-02-08 05:37:56,318 INFO L140 encePairwiseOnDemand]: 746/763 looper letters, 20 selfloop transitions, 9 changer transitions 0/668 dead transitions. [2025-02-08 05:37:56,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 668 transitions, 1522 flow [2025-02-08 05:37:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2185 transitions. [2025-02-08 05:37:56,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545653123634775 [2025-02-08 05:37:56,321 INFO L175 Difference]: Start difference. First operand has 650 places, 671 transitions, 1469 flow. Second operand 3 states and 2185 transitions. [2025-02-08 05:37:56,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 668 transitions, 1522 flow [2025-02-08 05:37:56,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 668 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:56,327 INFO L231 Difference]: Finished difference. Result has 644 places, 667 transitions, 1499 flow [2025-02-08 05:37:56,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1499, PETRI_PLACES=644, PETRI_TRANSITIONS=667} [2025-02-08 05:37:56,328 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -66 predicate places. [2025-02-08 05:37:56,328 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 667 transitions, 1499 flow [2025-02-08 05:37:56,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 718.0) internal successors, (2154), 3 states have internal predecessors, (2154), 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:37:56,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,329 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] [2025-02-08 05:37:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:56,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -94399978, now seen corresponding path program 1 times [2025-02-08 05:37:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117540356] [2025-02-08 05:37:56,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:37:56,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:37:56,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,356 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:37:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117540356] [2025-02-08 05:37:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117540356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730005312] [2025-02-08 05:37:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:37:56,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 667 transitions, 1499 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:37:56,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:37:56,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,210 INFO L124 PetriNetUnfolderBase]: 282/5623 cut-off events. [2025-02-08 05:37:57,211 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2025-02-08 05:37:57,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6519 conditions, 5623 events. 282/5623 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 53486 event pairs, 35 based on Foata normal form. 0/4819 useless extension candidates. Maximal degree in co-relation 5636. Up to 235 conditions per place. [2025-02-08 05:37:57,260 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 21 selfloop transitions, 3 changer transitions 0/667 dead transitions. [2025-02-08 05:37:57,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 667 transitions, 1548 flow [2025-02-08 05:37:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:37:57,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:37:57,264 INFO L175 Difference]: Start difference. First operand has 644 places, 667 transitions, 1499 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:37:57,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 667 transitions, 1548 flow [2025-02-08 05:37:57,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 667 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,272 INFO L231 Difference]: Finished difference. Result has 643 places, 666 transitions, 1485 flow [2025-02-08 05:37:57,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=643, PETRI_TRANSITIONS=666} [2025-02-08 05:37:57,274 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -67 predicate places. [2025-02-08 05:37:57,274 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 666 transitions, 1485 flow [2025-02-08 05:37:57,274 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:37:57,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,274 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] [2025-02-08 05:37:57,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:57,275 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:57,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1038603883, now seen corresponding path program 1 times [2025-02-08 05:37:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079133870] [2025-02-08 05:37:57,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:37:57,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:37:57,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,309 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:37:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079133870] [2025-02-08 05:37:57,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079133870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255792636] [2025-02-08 05:37:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:57,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:57,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:57,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:37:57,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 666 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 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:37:57,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:37:57,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:58,234 INFO L124 PetriNetUnfolderBase]: 245/5541 cut-off events. [2025-02-08 05:37:58,234 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:37:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 5541 events. 245/5541 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 52563 event pairs, 9 based on Foata normal form. 0/4802 useless extension candidates. Maximal degree in co-relation 5304. Up to 106 conditions per place. [2025-02-08 05:37:58,310 INFO L140 encePairwiseOnDemand]: 756/763 looper letters, 12 selfloop transitions, 3 changer transitions 0/663 dead transitions. [2025-02-08 05:37:58,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 663 transitions, 1510 flow [2025-02-08 05:37:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2025-02-08 05:37:58,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9650502402795981 [2025-02-08 05:37:58,313 INFO L175 Difference]: Start difference. First operand has 643 places, 666 transitions, 1485 flow. Second operand 3 states and 2209 transitions. [2025-02-08 05:37:58,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 663 transitions, 1510 flow [2025-02-08 05:37:58,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 663 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:58,320 INFO L231 Difference]: Finished difference. Result has 639 places, 662 transitions, 1477 flow [2025-02-08 05:37:58,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=639, PETRI_TRANSITIONS=662} [2025-02-08 05:37:58,321 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -71 predicate places. [2025-02-08 05:37:58,321 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 662 transitions, 1477 flow [2025-02-08 05:37:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 731.6666666666666) internal successors, (2195), 3 states have internal predecessors, (2195), 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:37:58,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:58,321 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] [2025-02-08 05:37:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:58,322 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:58,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1580709504, now seen corresponding path program 1 times [2025-02-08 05:37:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672025782] [2025-02-08 05:37:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:58,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:37:58,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:37:58,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,352 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:37:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672025782] [2025-02-08 05:37:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672025782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246532333] [2025-02-08 05:37:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:37:58,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 662 transitions, 1477 flow. Second operand has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:37:58,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:37:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:59,109 INFO L124 PetriNetUnfolderBase]: 273/5529 cut-off events. [2025-02-08 05:37:59,110 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-02-08 05:37:59,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 5529 events. 273/5529 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 51858 event pairs, 12 based on Foata normal form. 0/4821 useless extension candidates. Maximal degree in co-relation 5426. Up to 162 conditions per place. [2025-02-08 05:37:59,177 INFO L140 encePairwiseOnDemand]: 756/763 looper letters, 12 selfloop transitions, 3 changer transitions 0/659 dead transitions. [2025-02-08 05:37:59,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 659 transitions, 1502 flow [2025-02-08 05:37:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2209 transitions. [2025-02-08 05:37:59,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9650502402795981 [2025-02-08 05:37:59,179 INFO L175 Difference]: Start difference. First operand has 639 places, 662 transitions, 1477 flow. Second operand 3 states and 2209 transitions. [2025-02-08 05:37:59,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 659 transitions, 1502 flow [2025-02-08 05:37:59,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 659 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:59,186 INFO L231 Difference]: Finished difference. Result has 635 places, 658 transitions, 1469 flow [2025-02-08 05:37:59,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1469, PETRI_PLACES=635, PETRI_TRANSITIONS=658} [2025-02-08 05:37:59,188 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -75 predicate places. [2025-02-08 05:37:59,188 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 658 transitions, 1469 flow [2025-02-08 05:37:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:37:59,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:59,189 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] [2025-02-08 05:37:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:59,189 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:37:59,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash 614274221, now seen corresponding path program 1 times [2025-02-08 05:37:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830344374] [2025-02-08 05:37:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:59,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:37:59,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:37:59,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:59,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:59,224 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:37:59,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:59,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830344374] [2025-02-08 05:37:59,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830344374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:59,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:59,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766632866] [2025-02-08 05:37:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:59,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:59,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:59,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:59,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 763 [2025-02-08 05:37:59,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 658 transitions, 1469 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:37:59,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:59,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 763 [2025-02-08 05:37:59,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:00,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,537 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-02-08 05:38:00,537 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-02-08 05:38:00,537 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-02-08 05:38:00,538 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-02-08 05:38:00,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,538 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:38:00,538 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,538 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-08 05:38:00,538 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,540 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:38:00,540 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-08 05:38:00,540 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,540 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, 49#L55-14true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,547 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-02-08 05:38:00,547 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-02-08 05:38:00,548 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-02-08 05:38:00,548 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-02-08 05:38:00,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,569 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-02-08 05:38:00,569 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,569 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,569 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,570 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,570 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,570 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:00,570 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,571 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:00,571 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,571 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,571 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:00,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,573 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:00,573 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:00,573 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,573 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 837#(= |#race~nondet_0~0| 0), 49#L55-14true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,579 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-02-08 05:38:00,579 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,579 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,579 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, 49#L55-14true, Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,580 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-02-08 05:38:00,580 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:00,580 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,581 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-08 05:38:00,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,592 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][508], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,592 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:00,592 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:38:00,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,593 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-02-08 05:38:00,593 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:00,593 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:00,593 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:38:00,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, 49#L55-14true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,600 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-02-08 05:38:00,600 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-08 05:38:00,600 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-08 05:38:00,600 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:00,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2083] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][509], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,642 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2083] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][509], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,642 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:38:00,642 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:38:00,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,651 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-02-08 05:38:00,651 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-02-08 05:38:00,651 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:38:00,651 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:38:00,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2083] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][509], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), 127#L76-14true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,656 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-02-08 05:38:00,656 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-02-08 05:38:00,656 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-02-08 05:38:00,656 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:38:00,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2083] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][509], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,657 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-02-08 05:38:00,657 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-02-08 05:38:00,657 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-08 05:38:00,657 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-02-08 05:38:00,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][504], [437#L110true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, 834#(= |#race~i_8~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:00,664 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-02-08 05:38:00,664 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-02-08 05:38:00,664 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:38:00,664 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:38:00,696 INFO L124 PetriNetUnfolderBase]: 519/10293 cut-off events. [2025-02-08 05:38:00,696 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-02-08 05:38:00,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11551 conditions, 10293 events. 519/10293 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 103850 event pairs, 22 based on Foata normal form. 0/8968 useless extension candidates. Maximal degree in co-relation 10501. Up to 298 conditions per place. [2025-02-08 05:38:00,784 INFO L140 encePairwiseOnDemand]: 759/763 looper letters, 10 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2025-02-08 05:38:00,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 660 transitions, 1499 flow [2025-02-08 05:38:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-02-08 05:38:00,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733508082131935 [2025-02-08 05:38:00,786 INFO L175 Difference]: Start difference. First operand has 635 places, 658 transitions, 1469 flow. Second operand 3 states and 2228 transitions. [2025-02-08 05:38:00,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 660 transitions, 1499 flow [2025-02-08 05:38:00,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 660 transitions, 1493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:00,794 INFO L231 Difference]: Finished difference. Result has 634 places, 658 transitions, 1473 flow [2025-02-08 05:38:00,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1473, PETRI_PLACES=634, PETRI_TRANSITIONS=658} [2025-02-08 05:38:00,795 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -76 predicate places. [2025-02-08 05:38:00,796 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 658 transitions, 1473 flow [2025-02-08 05:38:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:38:00,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:00,796 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] [2025-02-08 05:38:00,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:38:00,797 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:00,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1964182797, now seen corresponding path program 1 times [2025-02-08 05:38:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98134421] [2025-02-08 05:38:00,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:00,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:38:00,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:38:00,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:00,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:00,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:38:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98134421] [2025-02-08 05:38:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98134421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056484353] [2025-02-08 05:38:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:00,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:00,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:00,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 658 transitions, 1473 flow. Second operand has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:01,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][503], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 835#true, 658#L108-1true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:01,936 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][503], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 835#true, 658#L108-1true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:01,936 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:01,936 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:01,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][503], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, Black: 835#true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:01,979 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1637] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][503], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, Black: 835#true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:01,979 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:38:01,979 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:02,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 835#true, 658#L108-1true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:02,407 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:38:02,407 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:02,407 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-08 05:38:02,407 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-08 05:38:02,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 835#true, 658#L108-1true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:02,429 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:02,429 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:02,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:02,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:02,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, Black: 835#true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:02,430 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:38:02,430 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:02,430 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:38:02,430 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-08 05:38:02,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 658#L108-1true, Black: 835#true, 839#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 783#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:02,450 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-02-08 05:38:02,450 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:02,450 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:38:02,450 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-08 05:38:02,529 INFO L124 PetriNetUnfolderBase]: 600/14120 cut-off events. [2025-02-08 05:38:02,529 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-08 05:38:02,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15873 conditions, 14120 events. 600/14120 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 156422 event pairs, 55 based on Foata normal form. 0/12445 useless extension candidates. Maximal degree in co-relation 14833. Up to 314 conditions per place. [2025-02-08 05:38:02,626 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 17 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2025-02-08 05:38:02,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 658 transitions, 1512 flow [2025-02-08 05:38:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:02,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:02,628 INFO L175 Difference]: Start difference. First operand has 634 places, 658 transitions, 1473 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:02,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 658 transitions, 1512 flow [2025-02-08 05:38:02,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 658 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:02,636 INFO L231 Difference]: Finished difference. Result has 635 places, 657 transitions, 1475 flow [2025-02-08 05:38:02,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=635, PETRI_TRANSITIONS=657} [2025-02-08 05:38:02,637 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -75 predicate places. [2025-02-08 05:38:02,637 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 657 transitions, 1475 flow [2025-02-08 05:38:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:02,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,638 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] [2025-02-08 05:38:02,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:38:02,638 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:02,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1002921050, now seen corresponding path program 1 times [2025-02-08 05:38:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-02-08 05:38:02,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:38:02,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:38:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,711 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:38:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-02-08 05:38:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475941743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:38:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33717514] [2025-02-08 05:38:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:38:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:38:02,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:38:02,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 763 [2025-02-08 05:38:02,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 657 transitions, 1475 flow. Second operand has 4 states, 4 states have (on average 737.75) internal successors, (2951), 4 states have internal predecessors, (2951), 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:38:02,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 763 [2025-02-08 05:38:02,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:04,529 INFO L124 PetriNetUnfolderBase]: 449/10859 cut-off events. [2025-02-08 05:38:04,529 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2025-02-08 05:38:04,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12136 conditions, 10859 events. 449/10859 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 104565 event pairs, 20 based on Foata normal form. 0/9550 useless extension candidates. Maximal degree in co-relation 11985. Up to 224 conditions per place. [2025-02-08 05:38:04,668 INFO L140 encePairwiseOnDemand]: 755/763 looper letters, 13 selfloop transitions, 8 changer transitions 0/666 dead transitions. [2025-02-08 05:38:04,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 666 transitions, 1539 flow [2025-02-08 05:38:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:38:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:38:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3702 transitions. [2025-02-08 05:38:04,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703800786369594 [2025-02-08 05:38:04,670 INFO L175 Difference]: Start difference. First operand has 635 places, 657 transitions, 1475 flow. Second operand 5 states and 3702 transitions. [2025-02-08 05:38:04,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 666 transitions, 1539 flow [2025-02-08 05:38:04,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 666 transitions, 1535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:04,678 INFO L231 Difference]: Finished difference. Result has 640 places, 661 transitions, 1517 flow [2025-02-08 05:38:04,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1517, PETRI_PLACES=640, PETRI_TRANSITIONS=661} [2025-02-08 05:38:04,679 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -70 predicate places. [2025-02-08 05:38:04,679 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 661 transitions, 1517 flow [2025-02-08 05:38:04,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 737.75) internal successors, (2951), 4 states have internal predecessors, (2951), 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:38:04,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,681 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] [2025-02-08 05:38:04,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:38:04,681 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:04,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1444511387, now seen corresponding path program 1 times [2025-02-08 05:38:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-02-08 05:38:04,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:38:04,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:38:04,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,754 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:38:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-02-08 05:38:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798562503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475507573] [2025-02-08 05:38:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:38:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:38:04,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:38:04,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 763 [2025-02-08 05:38:04,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 661 transitions, 1517 flow. Second operand has 5 states, 5 states have (on average 737.8) internal successors, (3689), 5 states have internal predecessors, (3689), 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:38:04,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 763 [2025-02-08 05:38:04,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:05,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 842#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, 844#(= ~i_4~0 0), Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:05,854 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-02-08 05:38:05,854 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-02-08 05:38:05,854 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:38:05,854 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-02-08 05:38:05,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 842#true, 837#(= |#race~nondet_0~0| 0), Black: 783#true, 844#(= ~i_4~0 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:05,872 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-02-08 05:38:05,872 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-02-08 05:38:05,872 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-02-08 05:38:05,872 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:38:06,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, 658#L108-1true, Black: 835#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, Black: 844#(= ~i_4~0 0), Black: 815#(= |#race~break_6~0| 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:06,118 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2025-02-08 05:38:06,118 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:38:06,118 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-08 05:38:06,118 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-08 05:38:06,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 851#true, 658#L108-1true, Black: 835#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, Black: 813#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:06,125 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-02-08 05:38:06,125 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:38:06,125 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:38:06,125 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:38:06,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, Black: 844#(= ~i_4~0 0), Black: 815#(= |#race~break_6~0| 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:06,126 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-02-08 05:38:06,126 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:38:06,126 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-08 05:38:06,126 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:38:06,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][497], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 851#true, 658#L108-1true, Black: 835#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, Black: 813#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:06,134 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2025-02-08 05:38:06,134 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:38:06,134 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:38:06,134 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-08 05:38:06,172 INFO L124 PetriNetUnfolderBase]: 361/8677 cut-off events. [2025-02-08 05:38:06,172 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2025-02-08 05:38:06,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9679 conditions, 8677 events. 361/8677 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 76728 event pairs, 14 based on Foata normal form. 1/7626 useless extension candidates. Maximal degree in co-relation 9451. Up to 155 conditions per place. [2025-02-08 05:38:06,285 INFO L140 encePairwiseOnDemand]: 756/763 looper letters, 7 selfloop transitions, 6 changer transitions 0/662 dead transitions. [2025-02-08 05:38:06,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 662 transitions, 1545 flow [2025-02-08 05:38:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:38:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:38:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3694 transitions. [2025-02-08 05:38:06,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9682830930537353 [2025-02-08 05:38:06,287 INFO L175 Difference]: Start difference. First operand has 640 places, 661 transitions, 1517 flow. Second operand 5 states and 3694 transitions. [2025-02-08 05:38:06,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 662 transitions, 1545 flow [2025-02-08 05:38:06,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 662 transitions, 1545 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:06,295 INFO L231 Difference]: Finished difference. Result has 645 places, 662 transitions, 1537 flow [2025-02-08 05:38:06,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1537, PETRI_PLACES=645, PETRI_TRANSITIONS=662} [2025-02-08 05:38:06,296 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -65 predicate places. [2025-02-08 05:38:06,296 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 662 transitions, 1537 flow [2025-02-08 05:38:06,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 737.8) internal successors, (3689), 5 states have internal predecessors, (3689), 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:38:06,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,297 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] [2025-02-08 05:38:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:38:06,297 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:06,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -792105290, now seen corresponding path program 1 times [2025-02-08 05:38:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743483043] [2025-02-08 05:38:06,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:06,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:06,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743483043] [2025-02-08 05:38:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743483043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:38:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12291119] [2025-02-08 05:38:06,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:38:06,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:06,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:38:06,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:38:06,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:06,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:06,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:38:06,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:38:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:38:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12291119] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:38:06,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:38:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-08 05:38:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349348443] [2025-02-08 05:38:06,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:38:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:38:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:38:06,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 763 [2025-02-08 05:38:06,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 662 transitions, 1537 flow. Second operand has 14 states, 14 states have (on average 735.0) internal successors, (10290), 14 states have internal predecessors, (10290), 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:38:06,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 763 [2025-02-08 05:38:06,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 861#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 842#true, Black: 783#true, 844#(= ~i_4~0 0), Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,060 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-02-08 05:38:08,060 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:38:08,060 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:38:08,060 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:38:08,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 861#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 842#true, Black: 783#true, 844#(= ~i_4~0 0), Black: 787#true, 707#L76-13true, Black: 821#true, 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,074 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-02-08 05:38:08,074 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:38:08,074 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:38:08,074 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-02-08 05:38:08,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, 658#L108-1true, Black: 835#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 815#(= |#race~break_6~0| 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, Black: 823#(= |#race~break_10~0| 0), 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,276 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-02-08 05:38:08,276 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-02-08 05:38:08,276 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-02-08 05:38:08,276 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 813#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,283 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), 851#true, Black: 835#true, 658#L108-1true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 815#(= |#race~break_6~0| 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, Black: 821#true, 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,283 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-02-08 05:38:08,283 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:08,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][505], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), 851#true, 658#L108-1true, Black: 835#true, 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 813#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 837#(= |#race~nondet_0~0| 0), Black: 783#true, Black: 787#true, 707#L76-13true, Black: 821#true, 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:08,290 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-02-08 05:38:08,290 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-02-08 05:38:08,290 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-02-08 05:38:08,290 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-02-08 05:38:08,324 INFO L124 PetriNetUnfolderBase]: 361/8694 cut-off events. [2025-02-08 05:38:08,324 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2025-02-08 05:38:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9719 conditions, 8694 events. 361/8694 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 76788 event pairs, 14 based on Foata normal form. 2/7644 useless extension candidates. Maximal degree in co-relation 9505. Up to 155 conditions per place. [2025-02-08 05:38:08,409 INFO L140 encePairwiseOnDemand]: 753/763 looper letters, 11 selfloop transitions, 13 changer transitions 0/670 dead transitions. [2025-02-08 05:38:08,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 670 transitions, 1603 flow [2025-02-08 05:38:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:38:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:38:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8089 transitions. [2025-02-08 05:38:08,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963779339926129 [2025-02-08 05:38:08,412 INFO L175 Difference]: Start difference. First operand has 645 places, 662 transitions, 1537 flow. Second operand 11 states and 8089 transitions. [2025-02-08 05:38:08,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 670 transitions, 1603 flow [2025-02-08 05:38:08,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 670 transitions, 1593 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:38:08,419 INFO L231 Difference]: Finished difference. Result has 655 places, 668 transitions, 1587 flow [2025-02-08 05:38:08,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1587, PETRI_PLACES=655, PETRI_TRANSITIONS=668} [2025-02-08 05:38:08,420 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -55 predicate places. [2025-02-08 05:38:08,420 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 668 transitions, 1587 flow [2025-02-08 05:38:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 735.0) internal successors, (10290), 14 states have internal predecessors, (10290), 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:38:08,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,421 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:08,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:38:08,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-08 05:38:08,622 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1046241578, now seen corresponding path program 2 times [2025-02-08 05:38:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531162461] [2025-02-08 05:38:08,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:38:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 2 equivalence classes. [2025-02-08 05:38:08,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 201 of 246 statements. [2025-02-08 05:38:08,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:38:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531162461] [2025-02-08 05:38:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531162461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646380307] [2025-02-08 05:38:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:08,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:09,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 763 [2025-02-08 05:38:09,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 668 transitions, 1587 flow. Second operand has 6 states, 6 states have (on average 731.5) internal successors, (4389), 6 states have internal predecessors, (4389), 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:38:09,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 763 [2025-02-08 05:38:09,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:10,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 835#true, 658#L108-1true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 861#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 842#true, 844#(= ~i_4~0 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,380 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-02-08 05:38:10,380 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:38:10,380 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:38:10,380 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:38:10,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [789#(= |#race~name_2~0| 0), 170#L55-13true, Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 658#L108-1true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 835#true, Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 861#true, Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 842#true, 844#(= ~i_4~0 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,398 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-02-08 05:38:10,398 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-02-08 05:38:10,398 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:38:10,399 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:38:10,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 835#true, 658#L108-1true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,638 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-02-08 05:38:10,638 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-02-08 05:38:10,638 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-02-08 05:38:10,638 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-02-08 05:38:10,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 658#L108-1true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 835#true, Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, Black: 823#(= |#race~break_10~0| 0), 785#(= |#race~name_1~0| 0), Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,645 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-02-08 05:38:10,645 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-02-08 05:38:10,645 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:10,645 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:10,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 658#L108-1true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 835#true, Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 815#(= |#race~break_6~0| 0), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,645 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-02-08 05:38:10,646 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:10,646 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-02-08 05:38:10,646 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:38:10,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1909] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [170#L55-13true, 789#(= |#race~name_2~0| 0), Black: 803#(= |#race~result_7~0| 0), Black: 2166#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 658#L108-1true, Black: 835#true, Black: 2174#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2180#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 810#(= ~name_2~0 ~name_1~0), Black: 808#true, 842#true, 861#true, Black: 844#(= ~i_4~0 0), Black: 813#true, Black: 847#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 783#true, 2184#true, 837#(= |#race~nondet_0~0| 0), Black: 787#true, 707#L76-13true, 785#(= |#race~name_1~0| 0), Black: 821#true, Black: 859#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 796#(= |#race~result_3~0| 0)]) [2025-02-08 05:38:10,653 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-02-08 05:38:10,653 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-02-08 05:38:10,653 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-02-08 05:38:10,653 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-02-08 05:38:10,691 INFO L124 PetriNetUnfolderBase]: 431/9694 cut-off events. [2025-02-08 05:38:10,691 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-08 05:38:10,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 9694 events. 431/9694 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 88631 event pairs, 17 based on Foata normal form. 0/8550 useless extension candidates. Maximal degree in co-relation 10835. Up to 155 conditions per place. [2025-02-08 05:38:10,792 INFO L140 encePairwiseOnDemand]: 757/763 looper letters, 17 selfloop transitions, 6 changer transitions 0/671 dead transitions. [2025-02-08 05:38:10,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1643 flow [2025-02-08 05:38:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4397 transitions. [2025-02-08 05:38:10,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604630843162953 [2025-02-08 05:38:10,795 INFO L175 Difference]: Start difference. First operand has 655 places, 668 transitions, 1587 flow. Second operand 6 states and 4397 transitions. [2025-02-08 05:38:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1643 flow [2025-02-08 05:38:10,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 671 transitions, 1631 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 05:38:10,803 INFO L231 Difference]: Finished difference. Result has 656 places, 667 transitions, 1585 flow [2025-02-08 05:38:10,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1585, PETRI_PLACES=656, PETRI_TRANSITIONS=667} [2025-02-08 05:38:10,804 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -54 predicate places. [2025-02-08 05:38:10,804 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 667 transitions, 1585 flow [2025-02-08 05:38:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 731.5) internal successors, (4389), 6 states have internal predecessors, (4389), 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:38:10,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:10,805 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:10,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:38:10,806 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:10,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2019017732, now seen corresponding path program 1 times [2025-02-08 05:38:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:10,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43217657] [2025-02-08 05:38:10,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-08 05:38:10,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-08 05:38:10,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:10,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43217657] [2025-02-08 05:38:10,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43217657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:10,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:10,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:38:10,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21884420] [2025-02-08 05:38:10,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:10,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:38:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:38:10,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:38:10,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 763 [2025-02-08 05:38:10,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 667 transitions, 1585 flow. Second operand has 4 states, 4 states have (on average 738.0) internal successors, (2952), 4 states have internal predecessors, (2952), 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:38:10,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:10,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 763 [2025-02-08 05:38:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:13,055 INFO L124 PetriNetUnfolderBase]: 593/12042 cut-off events. [2025-02-08 05:38:13,056 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2025-02-08 05:38:13,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13730 conditions, 12042 events. 593/12042 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 116925 event pairs, 26 based on Foata normal form. 0/10549 useless extension candidates. Maximal degree in co-relation 13514. Up to 241 conditions per place. [2025-02-08 05:38:13,188 INFO L140 encePairwiseOnDemand]: 755/763 looper letters, 12 selfloop transitions, 8 changer transitions 0/675 dead transitions. [2025-02-08 05:38:13,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 675 transitions, 1644 flow [2025-02-08 05:38:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:38:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:38:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3701 transitions. [2025-02-08 05:38:13,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701179554390563 [2025-02-08 05:38:13,190 INFO L175 Difference]: Start difference. First operand has 656 places, 667 transitions, 1585 flow. Second operand 5 states and 3701 transitions. [2025-02-08 05:38:13,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 675 transitions, 1644 flow [2025-02-08 05:38:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 675 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:13,198 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1619 flow [2025-02-08 05:38:13,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1619, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-02-08 05:38:13,199 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -52 predicate places. [2025-02-08 05:38:13,199 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1619 flow [2025-02-08 05:38:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 738.0) internal successors, (2952), 4 states have internal predecessors, (2952), 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:38:13,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:13,200 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:38:13,200 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -948086115, now seen corresponding path program 1 times [2025-02-08 05:38:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145555582] [2025-02-08 05:38:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:13,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-08 05:38:13,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-08 05:38:13,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:13,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145555582] [2025-02-08 05:38:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145555582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107293853] [2025-02-08 05:38:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:13,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:13,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:13,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:13,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:13,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1619 flow. Second operand has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:13,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:13,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,372 INFO L124 PetriNetUnfolderBase]: 669/12458 cut-off events. [2025-02-08 05:38:15,372 INFO L125 PetriNetUnfolderBase]: For 619/623 co-relation queries the response was YES. [2025-02-08 05:38:15,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14687 conditions, 12458 events. 669/12458 cut-off events. For 619/623 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 124946 event pairs, 94 based on Foata normal form. 0/10952 useless extension candidates. Maximal degree in co-relation 14466. Up to 561 conditions per place. [2025-02-08 05:38:15,511 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 2 changer transitions 1/671 dead transitions. [2025-02-08 05:38:15,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1658 flow [2025-02-08 05:38:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:15,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:15,513 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1619 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:15,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1658 flow [2025-02-08 05:38:15,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 671 transitions, 1658 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:15,521 INFO L231 Difference]: Finished difference. Result has 659 places, 670 transitions, 1621 flow [2025-02-08 05:38:15,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1621, PETRI_PLACES=659, PETRI_TRANSITIONS=670} [2025-02-08 05:38:15,522 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -51 predicate places. [2025-02-08 05:38:15,522 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 670 transitions, 1621 flow [2025-02-08 05:38:15,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:15,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,523 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:15,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:38:15,523 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:15,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -110064932, now seen corresponding path program 1 times [2025-02-08 05:38:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060113715] [2025-02-08 05:38:15,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 05:38:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 05:38:15,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060113715] [2025-02-08 05:38:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060113715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614007785] [2025-02-08 05:38:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 763 [2025-02-08 05:38:15,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 670 transitions, 1621 flow. Second operand has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 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:38:15,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 763 [2025-02-08 05:38:15,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,540 INFO L124 PetriNetUnfolderBase]: 525/11390 cut-off events. [2025-02-08 05:38:17,540 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2025-02-08 05:38:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13141 conditions, 11390 events. 525/11390 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 106494 event pairs, 52 based on Foata normal form. 0/10072 useless extension candidates. Maximal degree in co-relation 12919. Up to 223 conditions per place. [2025-02-08 05:38:17,652 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 11 selfloop transitions, 2 changer transitions 0/670 dead transitions. [2025-02-08 05:38:17,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 670 transitions, 1648 flow [2025-02-08 05:38:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2025-02-08 05:38:17,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694189602446484 [2025-02-08 05:38:17,654 INFO L175 Difference]: Start difference. First operand has 659 places, 670 transitions, 1621 flow. Second operand 3 states and 2219 transitions. [2025-02-08 05:38:17,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 670 transitions, 1648 flow [2025-02-08 05:38:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 670 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:17,662 INFO L231 Difference]: Finished difference. Result has 658 places, 669 transitions, 1619 flow [2025-02-08 05:38:17,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1619, PETRI_PLACES=658, PETRI_TRANSITIONS=669} [2025-02-08 05:38:17,663 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -52 predicate places. [2025-02-08 05:38:17,663 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 669 transitions, 1619 flow [2025-02-08 05:38:17,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.6666666666666) internal successors, (2210), 3 states have internal predecessors, (2210), 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:38:17,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:17,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:38:17,664 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1837490037, now seen corresponding path program 1 times [2025-02-08 05:38:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511937399] [2025-02-08 05:38:17,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 05:38:17,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 05:38:17,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511937399] [2025-02-08 05:38:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511937399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:17,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137533605] [2025-02-08 05:38:17,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:17,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:18,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 763 [2025-02-08 05:38:18,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 669 transitions, 1619 flow. Second operand has 6 states, 6 states have (on average 731.6666666666666) internal successors, (4390), 6 states have internal predecessors, (4390), 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:38:18,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:18,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 763 [2025-02-08 05:38:18,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,120 INFO L124 PetriNetUnfolderBase]: 624/12389 cut-off events. [2025-02-08 05:38:20,120 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2025-02-08 05:38:20,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14489 conditions, 12389 events. 624/12389 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 123502 event pairs, 30 based on Foata normal form. 0/10997 useless extension candidates. Maximal degree in co-relation 14253. Up to 249 conditions per place. [2025-02-08 05:38:20,254 INFO L140 encePairwiseOnDemand]: 757/763 looper letters, 17 selfloop transitions, 6 changer transitions 0/672 dead transitions. [2025-02-08 05:38:20,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 672 transitions, 1675 flow [2025-02-08 05:38:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4397 transitions. [2025-02-08 05:38:20,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604630843162953 [2025-02-08 05:38:20,256 INFO L175 Difference]: Start difference. First operand has 658 places, 669 transitions, 1619 flow. Second operand 6 states and 4397 transitions. [2025-02-08 05:38:20,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 672 transitions, 1675 flow [2025-02-08 05:38:20,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 672 transitions, 1671 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,265 INFO L231 Difference]: Finished difference. Result has 660 places, 668 transitions, 1625 flow [2025-02-08 05:38:20,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1625, PETRI_PLACES=660, PETRI_TRANSITIONS=668} [2025-02-08 05:38:20,266 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -50 predicate places. [2025-02-08 05:38:20,266 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 668 transitions, 1625 flow [2025-02-08 05:38:20,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 731.6666666666666) internal successors, (4390), 6 states have internal predecessors, (4390), 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:38:20,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,267 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:20,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:38:20,267 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1765940000, now seen corresponding path program 1 times [2025-02-08 05:38:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-02-08 05:38:20,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-08 05:38:20,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-08 05:38:20,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:20,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-02-08 05:38:20,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58011615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292122399] [2025-02-08 05:38:20,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 763 [2025-02-08 05:38:20,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 668 transitions, 1625 flow. Second operand has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:20,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 763 [2025-02-08 05:38:20,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:22,864 INFO L124 PetriNetUnfolderBase]: 603/13272 cut-off events. [2025-02-08 05:38:22,865 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-02-08 05:38:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15537 conditions, 13272 events. 603/13272 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 125961 event pairs, 26 based on Foata normal form. 0/11848 useless extension candidates. Maximal degree in co-relation 15315. Up to 275 conditions per place. [2025-02-08 05:38:22,997 INFO L140 encePairwiseOnDemand]: 757/763 looper letters, 14 selfloop transitions, 2 changer transitions 0/667 dead transitions. [2025-02-08 05:38:22,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 667 transitions, 1657 flow [2025-02-08 05:38:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2213 transitions. [2025-02-08 05:38:22,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667977282656182 [2025-02-08 05:38:22,999 INFO L175 Difference]: Start difference. First operand has 660 places, 668 transitions, 1625 flow. Second operand 3 states and 2213 transitions. [2025-02-08 05:38:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 667 transitions, 1657 flow [2025-02-08 05:38:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 667 transitions, 1645 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:23,008 INFO L231 Difference]: Finished difference. Result has 654 places, 665 transitions, 1615 flow [2025-02-08 05:38:23,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=654, PETRI_TRANSITIONS=665} [2025-02-08 05:38:23,009 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -56 predicate places. [2025-02-08 05:38:23,009 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 665 transitions, 1615 flow [2025-02-08 05:38:23,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:23,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,010 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:23,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 05:38:23,010 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1818956271, now seen corresponding path program 1 times [2025-02-08 05:38:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-02-08 05:38:23,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-08 05:38:23,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-08 05:38:23,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-02-08 05:38:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542202469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709442084] [2025-02-08 05:38:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:23,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 763 [2025-02-08 05:38:23,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 665 transitions, 1615 flow. Second operand has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 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:38:23,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:23,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 763 [2025-02-08 05:38:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:25,156 INFO L124 PetriNetUnfolderBase]: 645/11766 cut-off events. [2025-02-08 05:38:25,157 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2025-02-08 05:38:25,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 11766 events. 645/11766 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 116572 event pairs, 82 based on Foata normal form. 0/10510 useless extension candidates. Maximal degree in co-relation 13675. Up to 434 conditions per place. [2025-02-08 05:38:25,250 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 11 selfloop transitions, 2 changer transitions 0/665 dead transitions. [2025-02-08 05:38:25,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 665 transitions, 1642 flow [2025-02-08 05:38:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2025-02-08 05:38:25,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694189602446484 [2025-02-08 05:38:25,253 INFO L175 Difference]: Start difference. First operand has 654 places, 665 transitions, 1615 flow. Second operand 3 states and 2219 transitions. [2025-02-08 05:38:25,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 665 transitions, 1642 flow [2025-02-08 05:38:25,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 665 transitions, 1640 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:25,260 INFO L231 Difference]: Finished difference. Result has 654 places, 664 transitions, 1615 flow [2025-02-08 05:38:25,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=654, PETRI_TRANSITIONS=664} [2025-02-08 05:38:25,262 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -56 predicate places. [2025-02-08 05:38:25,262 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 664 transitions, 1615 flow [2025-02-08 05:38:25,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 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:38:25,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:25,263 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:25,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 05:38:25,263 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash -941121579, now seen corresponding path program 1 times [2025-02-08 05:38:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034295897] [2025-02-08 05:38:25,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:25,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 05:38:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 05:38:25,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:25,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034295897] [2025-02-08 05:38:25,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034295897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:25,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:25,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396948329] [2025-02-08 05:38:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:25,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:25,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:25,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:25,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 763 [2025-02-08 05:38:25,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 664 transitions, 1615 flow. Second operand has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 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:38:25,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:25,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 763 [2025-02-08 05:38:25,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:27,324 INFO L124 PetriNetUnfolderBase]: 651/11559 cut-off events. [2025-02-08 05:38:27,324 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2025-02-08 05:38:27,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13824 conditions, 11559 events. 651/11559 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 115183 event pairs, 30 based on Foata normal form. 0/10504 useless extension candidates. Maximal degree in co-relation 13601. Up to 520 conditions per place. [2025-02-08 05:38:27,503 INFO L140 encePairwiseOnDemand]: 757/763 looper letters, 13 selfloop transitions, 2 changer transitions 0/662 dead transitions. [2025-02-08 05:38:27,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 662 transitions, 1644 flow [2025-02-08 05:38:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2212 transitions. [2025-02-08 05:38:27,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663608562691132 [2025-02-08 05:38:27,504 INFO L175 Difference]: Start difference. First operand has 654 places, 664 transitions, 1615 flow. Second operand 3 states and 2212 transitions. [2025-02-08 05:38:27,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 662 transitions, 1644 flow [2025-02-08 05:38:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 662 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:27,513 INFO L231 Difference]: Finished difference. Result has 651 places, 661 transitions, 1613 flow [2025-02-08 05:38:27,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1613, PETRI_PLACES=651, PETRI_TRANSITIONS=661} [2025-02-08 05:38:27,514 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:38:27,514 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 661 transitions, 1613 flow [2025-02-08 05:38:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 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:38:27,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:27,515 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:27,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 05:38:27,515 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:27,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash 907906154, now seen corresponding path program 1 times [2025-02-08 05:38:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890635203] [2025-02-08 05:38:27,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:27,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:38:27,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:38:27,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:27,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:27,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890635203] [2025-02-08 05:38:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890635203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:27,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:27,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404410376] [2025-02-08 05:38:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:27,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:27,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 661 transitions, 1613 flow. Second operand has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:38:27,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:27,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:30,149 INFO L124 PetriNetUnfolderBase]: 757/16598 cut-off events. [2025-02-08 05:38:30,149 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-02-08 05:38:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19403 conditions, 16598 events. 757/16598 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 171392 event pairs, 75 based on Foata normal form. 0/15159 useless extension candidates. Maximal degree in co-relation 19179. Up to 366 conditions per place. [2025-02-08 05:38:30,357 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2025-02-08 05:38:30,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 661 transitions, 1652 flow [2025-02-08 05:38:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:30,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:30,359 INFO L175 Difference]: Start difference. First operand has 651 places, 661 transitions, 1613 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:30,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 661 transitions, 1652 flow [2025-02-08 05:38:30,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 661 transitions, 1650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:30,373 INFO L231 Difference]: Finished difference. Result has 651 places, 660 transitions, 1615 flow [2025-02-08 05:38:30,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=651, PETRI_TRANSITIONS=660} [2025-02-08 05:38:30,374 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:38:30,374 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 660 transitions, 1615 flow [2025-02-08 05:38:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:38:30,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:30,374 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:30,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 05:38:30,374 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:30,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1327557601, now seen corresponding path program 1 times [2025-02-08 05:38:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:30,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371333598] [2025-02-08 05:38:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-08 05:38:30,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-08 05:38:30,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371333598] [2025-02-08 05:38:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371333598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869130702] [2025-02-08 05:38:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:30,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:30,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:30,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:30,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:30,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 660 transitions, 1615 flow. Second operand has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:30,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:30,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:30,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:32,293 INFO L124 PetriNetUnfolderBase]: 699/12012 cut-off events. [2025-02-08 05:38:32,293 INFO L125 PetriNetUnfolderBase]: For 598/602 co-relation queries the response was YES. [2025-02-08 05:38:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14621 conditions, 12012 events. 699/12012 cut-off events. For 598/602 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 120428 event pairs, 110 based on Foata normal form. 0/10980 useless extension candidates. Maximal degree in co-relation 14397. Up to 609 conditions per place. [2025-02-08 05:38:32,427 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 3 changer transitions 0/660 dead transitions. [2025-02-08 05:38:32,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 660 transitions, 1654 flow [2025-02-08 05:38:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:32,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:32,429 INFO L175 Difference]: Start difference. First operand has 651 places, 660 transitions, 1615 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:32,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 660 transitions, 1654 flow [2025-02-08 05:38:32,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 660 transitions, 1648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:32,441 INFO L231 Difference]: Finished difference. Result has 650 places, 659 transitions, 1613 flow [2025-02-08 05:38:32,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1613, PETRI_PLACES=650, PETRI_TRANSITIONS=659} [2025-02-08 05:38:32,442 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -60 predicate places. [2025-02-08 05:38:32,442 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 659 transitions, 1613 flow [2025-02-08 05:38:32,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:32,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:32,442 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 05:38:32,443 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1881697139, now seen corresponding path program 1 times [2025-02-08 05:38:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611406244] [2025-02-08 05:38:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:32,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-08 05:38:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-08 05:38:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611406244] [2025-02-08 05:38:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611406244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:32,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810636498] [2025-02-08 05:38:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:32,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:32,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:38:32,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 659 transitions, 1613 flow. Second operand has 3 states, 3 states have (on average 730.6666666666666) internal successors, (2192), 3 states have internal predecessors, (2192), 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:38:32,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:32,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:38:32,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:34,953 INFO L124 PetriNetUnfolderBase]: 801/17754 cut-off events. [2025-02-08 05:38:34,953 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2025-02-08 05:38:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20977 conditions, 17754 events. 801/17754 cut-off events. For 466/468 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 184843 event pairs, 66 based on Foata normal form. 0/16305 useless extension candidates. Maximal degree in co-relation 20753. Up to 394 conditions per place. [2025-02-08 05:38:35,091 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 21 selfloop transitions, 3 changer transitions 0/659 dead transitions. [2025-02-08 05:38:35,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 659 transitions, 1662 flow [2025-02-08 05:38:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:38:35,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:38:35,093 INFO L175 Difference]: Start difference. First operand has 650 places, 659 transitions, 1613 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:38:35,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 659 transitions, 1662 flow [2025-02-08 05:38:35,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 659 transitions, 1656 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:35,103 INFO L231 Difference]: Finished difference. Result has 649 places, 658 transitions, 1611 flow [2025-02-08 05:38:35,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1611, PETRI_PLACES=649, PETRI_TRANSITIONS=658} [2025-02-08 05:38:35,104 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -61 predicate places. [2025-02-08 05:38:35,104 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 658 transitions, 1611 flow [2025-02-08 05:38:35,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.6666666666666) internal successors, (2192), 3 states have internal predecessors, (2192), 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:38:35,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:35,105 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:35,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 05:38:35,105 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:35,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1987336104, now seen corresponding path program 1 times [2025-02-08 05:38:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:35,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755664457] [2025-02-08 05:38:35,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:35,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-08 05:38:35,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-08 05:38:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:35,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755664457] [2025-02-08 05:38:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755664457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867647027] [2025-02-08 05:38:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:35,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:35,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:38:35,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 658 transitions, 1611 flow. Second operand has 3 states, 3 states have (on average 731.0) internal successors, (2193), 3 states have internal predecessors, (2193), 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:38:35,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:35,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:38:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:37,305 INFO L124 PetriNetUnfolderBase]: 697/11994 cut-off events. [2025-02-08 05:38:37,305 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2025-02-08 05:38:37,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14537 conditions, 11994 events. 697/11994 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 120717 event pairs, 118 based on Foata normal form. 0/11004 useless extension candidates. Maximal degree in co-relation 14313. Up to 648 conditions per place. [2025-02-08 05:38:37,421 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 21 selfloop transitions, 3 changer transitions 0/658 dead transitions. [2025-02-08 05:38:37,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 658 transitions, 1660 flow [2025-02-08 05:38:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:38:37,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:38:37,424 INFO L175 Difference]: Start difference. First operand has 649 places, 658 transitions, 1611 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:38:37,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 658 transitions, 1660 flow [2025-02-08 05:38:37,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 658 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:37,434 INFO L231 Difference]: Finished difference. Result has 648 places, 657 transitions, 1609 flow [2025-02-08 05:38:37,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1609, PETRI_PLACES=648, PETRI_TRANSITIONS=657} [2025-02-08 05:38:37,435 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -62 predicate places. [2025-02-08 05:38:37,435 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 657 transitions, 1609 flow [2025-02-08 05:38:37,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 731.0) internal successors, (2193), 3 states have internal predecessors, (2193), 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:38:37,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:37,436 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:37,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 05:38:37,436 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:37,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash -252971199, now seen corresponding path program 1 times [2025-02-08 05:38:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631747858] [2025-02-08 05:38:37,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-08 05:38:37,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-08 05:38:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631747858] [2025-02-08 05:38:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631747858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235126515] [2025-02-08 05:38:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:37,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:37,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:37,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 763 [2025-02-08 05:38:37,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 657 transitions, 1609 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:38:37,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:37,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 763 [2025-02-08 05:38:37,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:39,409 INFO L124 PetriNetUnfolderBase]: 513/11078 cut-off events. [2025-02-08 05:38:39,410 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2025-02-08 05:38:39,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13006 conditions, 11078 events. 513/11078 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 98957 event pairs, 40 based on Foata normal form. 0/10193 useless extension candidates. Maximal degree in co-relation 12783. Up to 179 conditions per place. [2025-02-08 05:38:39,562 INFO L140 encePairwiseOnDemand]: 759/763 looper letters, 10 selfloop transitions, 3 changer transitions 0/660 dead transitions. [2025-02-08 05:38:39,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 660 transitions, 1642 flow [2025-02-08 05:38:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-02-08 05:38:39,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733508082131935 [2025-02-08 05:38:39,564 INFO L175 Difference]: Start difference. First operand has 648 places, 657 transitions, 1609 flow. Second operand 3 states and 2228 transitions. [2025-02-08 05:38:39,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 660 transitions, 1642 flow [2025-02-08 05:38:39,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 660 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:39,572 INFO L231 Difference]: Finished difference. Result has 650 places, 659 transitions, 1625 flow [2025-02-08 05:38:39,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1625, PETRI_PLACES=650, PETRI_TRANSITIONS=659} [2025-02-08 05:38:39,573 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -60 predicate places. [2025-02-08 05:38:39,573 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 659 transitions, 1625 flow [2025-02-08 05:38:39,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:38:39,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,574 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:39,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 05:38:39,574 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:39,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 72526246, now seen corresponding path program 1 times [2025-02-08 05:38:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850839079] [2025-02-08 05:38:39,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-08 05:38:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-08 05:38:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850839079] [2025-02-08 05:38:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850839079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703482803] [2025-02-08 05:38:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:39,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 659 transitions, 1625 flow. Second operand has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:39,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:42,187 INFO L124 PetriNetUnfolderBase]: 833/18443 cut-off events. [2025-02-08 05:38:42,187 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2025-02-08 05:38:42,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21727 conditions, 18443 events. 833/18443 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 191082 event pairs, 71 based on Foata normal form. 0/17047 useless extension candidates. Maximal degree in co-relation 21502. Up to 381 conditions per place. [2025-02-08 05:38:42,380 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 3 changer transitions 0/659 dead transitions. [2025-02-08 05:38:42,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 659 transitions, 1664 flow [2025-02-08 05:38:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:42,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:42,382 INFO L175 Difference]: Start difference. First operand has 650 places, 659 transitions, 1625 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:42,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 659 transitions, 1664 flow [2025-02-08 05:38:42,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 659 transitions, 1658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:42,391 INFO L231 Difference]: Finished difference. Result has 649 places, 658 transitions, 1623 flow [2025-02-08 05:38:42,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1623, PETRI_PLACES=649, PETRI_TRANSITIONS=658} [2025-02-08 05:38:42,392 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -61 predicate places. [2025-02-08 05:38:42,392 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 658 transitions, 1623 flow [2025-02-08 05:38:42,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.6666666666666) internal successors, (2198), 3 states have internal predecessors, (2198), 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:38:42,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:42,392 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:42,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-08 05:38:42,392 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -204503050, now seen corresponding path program 1 times [2025-02-08 05:38:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-02-08 05:38:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:42,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-08 05:38:42,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-08 05:38:42,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:42,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-02-08 05:38:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949401269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016895659] [2025-02-08 05:38:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:42,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:42,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:42,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:42,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 763 [2025-02-08 05:38:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 658 transitions, 1623 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:38:42,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:42,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 763 [2025-02-08 05:38:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,195 INFO L124 PetriNetUnfolderBase]: 589/11404 cut-off events. [2025-02-08 05:38:44,195 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-02-08 05:38:44,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13593 conditions, 11404 events. 589/11404 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 110463 event pairs, 59 based on Foata normal form. 0/10483 useless extension candidates. Maximal degree in co-relation 13369. Up to 317 conditions per place. [2025-02-08 05:38:44,301 INFO L140 encePairwiseOnDemand]: 759/763 looper letters, 10 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2025-02-08 05:38:44,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 661 transitions, 1656 flow [2025-02-08 05:38:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-02-08 05:38:44,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733508082131935 [2025-02-08 05:38:44,303 INFO L175 Difference]: Start difference. First operand has 649 places, 658 transitions, 1623 flow. Second operand 3 states and 2228 transitions. [2025-02-08 05:38:44,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 661 transitions, 1656 flow [2025-02-08 05:38:44,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 661 transitions, 1650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,310 INFO L231 Difference]: Finished difference. Result has 651 places, 660 transitions, 1639 flow [2025-02-08 05:38:44,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=651, PETRI_TRANSITIONS=660} [2025-02-08 05:38:44,311 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:38:44,311 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 660 transitions, 1639 flow [2025-02-08 05:38:44,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:38:44,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,312 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-08 05:38:44,312 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash -594214117, now seen corresponding path program 1 times [2025-02-08 05:38:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-02-08 05:38:44,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-08 05:38:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-08 05:38:44,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-02-08 05:38:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031932003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627330665] [2025-02-08 05:38:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 730 out of 763 [2025-02-08 05:38:44,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 660 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 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:38:44,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 730 of 763 [2025-02-08 05:38:44,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,232 INFO L124 PetriNetUnfolderBase]: 699/12064 cut-off events. [2025-02-08 05:38:46,232 INFO L125 PetriNetUnfolderBase]: For 723/727 co-relation queries the response was YES. [2025-02-08 05:38:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15014 conditions, 12064 events. 699/12064 cut-off events. For 723/727 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 122122 event pairs, 102 based on Foata normal form. 0/11227 useless extension candidates. Maximal degree in co-relation 14788. Up to 577 conditions per place. [2025-02-08 05:38:46,389 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 16 selfloop transitions, 3 changer transitions 0/660 dead transitions. [2025-02-08 05:38:46,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 660 transitions, 1678 flow [2025-02-08 05:38:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2207 transitions. [2025-02-08 05:38:46,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9641764962865881 [2025-02-08 05:38:46,390 INFO L175 Difference]: Start difference. First operand has 651 places, 660 transitions, 1639 flow. Second operand 3 states and 2207 transitions. [2025-02-08 05:38:46,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 660 transitions, 1678 flow [2025-02-08 05:38:46,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 660 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,399 INFO L231 Difference]: Finished difference. Result has 650 places, 659 transitions, 1637 flow [2025-02-08 05:38:46,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=650, PETRI_TRANSITIONS=659} [2025-02-08 05:38:46,400 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -60 predicate places. [2025-02-08 05:38:46,400 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 659 transitions, 1637 flow [2025-02-08 05:38:46,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 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:38:46,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,401 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:46,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-08 05:38:46,401 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:46,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2007750446, now seen corresponding path program 1 times [2025-02-08 05:38:46,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562532057] [2025-02-08 05:38:46,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-08 05:38:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-08 05:38:46,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562532057] [2025-02-08 05:38:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562532057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531340806] [2025-02-08 05:38:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 763 [2025-02-08 05:38:46,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 659 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:38:46,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 763 [2025-02-08 05:38:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,372 INFO L124 PetriNetUnfolderBase]: 513/11224 cut-off events. [2025-02-08 05:38:48,373 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2025-02-08 05:38:48,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13462 conditions, 11224 events. 513/11224 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 99617 event pairs, 40 based on Foata normal form. 0/10430 useless extension candidates. Maximal degree in co-relation 13237. Up to 179 conditions per place. [2025-02-08 05:38:48,544 INFO L140 encePairwiseOnDemand]: 759/763 looper letters, 10 selfloop transitions, 3 changer transitions 0/662 dead transitions. [2025-02-08 05:38:48,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 662 transitions, 1670 flow [2025-02-08 05:38:48,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-02-08 05:38:48,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733508082131935 [2025-02-08 05:38:48,546 INFO L175 Difference]: Start difference. First operand has 650 places, 659 transitions, 1637 flow. Second operand 3 states and 2228 transitions. [2025-02-08 05:38:48,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 662 transitions, 1670 flow [2025-02-08 05:38:48,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 662 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,555 INFO L231 Difference]: Finished difference. Result has 652 places, 661 transitions, 1653 flow [2025-02-08 05:38:48,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=652, PETRI_TRANSITIONS=661} [2025-02-08 05:38:48,556 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -58 predicate places. [2025-02-08 05:38:48,556 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 661 transitions, 1653 flow [2025-02-08 05:38:48,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:38:48,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,556 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:48,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-08 05:38:48,557 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -627423789, now seen corresponding path program 1 times [2025-02-08 05:38:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-02-08 05:38:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 05:38:48,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 05:38:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-02-08 05:38:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135714428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320802612] [2025-02-08 05:38:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:38:48,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 661 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:38:48,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:38:48,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:52,390 INFO L124 PetriNetUnfolderBase]: 989/22552 cut-off events. [2025-02-08 05:38:52,390 INFO L125 PetriNetUnfolderBase]: For 436/438 co-relation queries the response was YES. [2025-02-08 05:38:52,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27011 conditions, 22552 events. 989/22552 cut-off events. For 436/438 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 244573 event pairs, 68 based on Foata normal form. 0/21045 useless extension candidates. Maximal degree in co-relation 26784. Up to 502 conditions per place. [2025-02-08 05:38:52,639 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 22 selfloop transitions, 2 changer transitions 0/661 dead transitions. [2025-02-08 05:38:52,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 661 transitions, 1702 flow [2025-02-08 05:38:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:38:52,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:38:52,641 INFO L175 Difference]: Start difference. First operand has 652 places, 661 transitions, 1653 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:38:52,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 661 transitions, 1702 flow [2025-02-08 05:38:52,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 661 transitions, 1696 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:52,654 INFO L231 Difference]: Finished difference. Result has 651 places, 660 transitions, 1649 flow [2025-02-08 05:38:52,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=651, PETRI_TRANSITIONS=660} [2025-02-08 05:38:52,654 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:38:52,654 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 660 transitions, 1649 flow [2025-02-08 05:38:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 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:38:52,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:52,655 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:52,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-08 05:38:52,655 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:52,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1162836201, now seen corresponding path program 1 times [2025-02-08 05:38:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-02-08 05:38:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:52,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:38:52,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:38:52,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:52,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312212391] [2025-02-08 05:38:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312212391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630988116] [2025-02-08 05:38:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:52,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:52,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:52,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:52,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 763 [2025-02-08 05:38:52,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 660 transitions, 1649 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:38:52,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:52,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 763 [2025-02-08 05:38:52,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,888 INFO L124 PetriNetUnfolderBase]: 581/11548 cut-off events. [2025-02-08 05:38:54,889 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-02-08 05:38:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14067 conditions, 11548 events. 581/11548 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 111577 event pairs, 59 based on Foata normal form. 0/10738 useless extension candidates. Maximal degree in co-relation 13841. Up to 317 conditions per place. [2025-02-08 05:38:55,006 INFO L140 encePairwiseOnDemand]: 759/763 looper letters, 10 selfloop transitions, 3 changer transitions 0/663 dead transitions. [2025-02-08 05:38:55,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 663 transitions, 1682 flow [2025-02-08 05:38:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-02-08 05:38:55,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733508082131935 [2025-02-08 05:38:55,007 INFO L175 Difference]: Start difference. First operand has 651 places, 660 transitions, 1649 flow. Second operand 3 states and 2228 transitions. [2025-02-08 05:38:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 663 transitions, 1682 flow [2025-02-08 05:38:55,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 663 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,017 INFO L231 Difference]: Finished difference. Result has 653 places, 662 transitions, 1667 flow [2025-02-08 05:38:55,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=653, PETRI_TRANSITIONS=662} [2025-02-08 05:38:55,017 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -57 predicate places. [2025-02-08 05:38:55,018 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 662 transitions, 1667 flow [2025-02-08 05:38:55,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:38:55,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:55,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-08 05:38:55,018 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:55,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash -841185586, now seen corresponding path program 1 times [2025-02-08 05:38:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944446822] [2025-02-08 05:38:55,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 05:38:55,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 05:38:55,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944446822] [2025-02-08 05:38:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944446822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797580289] [2025-02-08 05:38:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 763 [2025-02-08 05:38:55,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 662 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:55,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 763 [2025-02-08 05:38:55,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,446 INFO L124 PetriNetUnfolderBase]: 727/12388 cut-off events. [2025-02-08 05:38:57,447 INFO L125 PetriNetUnfolderBase]: For 755/759 co-relation queries the response was YES. [2025-02-08 05:38:57,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15831 conditions, 12388 events. 727/12388 cut-off events. For 755/759 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 126718 event pairs, 122 based on Foata normal form. 0/11640 useless extension candidates. Maximal degree in co-relation 15603. Up to 694 conditions per place. [2025-02-08 05:38:57,658 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 22 selfloop transitions, 2 changer transitions 0/662 dead transitions. [2025-02-08 05:38:57,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 662 transitions, 1716 flow [2025-02-08 05:38:57,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2025-02-08 05:38:57,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963302752293578 [2025-02-08 05:38:57,660 INFO L175 Difference]: Start difference. First operand has 653 places, 662 transitions, 1667 flow. Second operand 3 states and 2205 transitions. [2025-02-08 05:38:57,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 662 transitions, 1716 flow [2025-02-08 05:38:57,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 662 transitions, 1710 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,672 INFO L231 Difference]: Finished difference. Result has 652 places, 661 transitions, 1663 flow [2025-02-08 05:38:57,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=652, PETRI_TRANSITIONS=661} [2025-02-08 05:38:57,672 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -58 predicate places. [2025-02-08 05:38:57,672 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 661 transitions, 1663 flow [2025-02-08 05:38:57,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 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:38:57,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,673 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:57,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-08 05:38:57,673 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:57,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1620819737, now seen corresponding path program 1 times [2025-02-08 05:38:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-02-08 05:38:57,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-08 05:38:57,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-08 05:38:57,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:38:57,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-02-08 05:38:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007299962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164107136] [2025-02-08 05:38:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 763 [2025-02-08 05:38:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 661 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 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:38:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 763 [2025-02-08 05:38:57,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:59,636 INFO L124 PetriNetUnfolderBase]: 507/11212 cut-off events. [2025-02-08 05:38:59,637 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-02-08 05:38:59,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13712 conditions, 11212 events. 507/11212 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 103272 event pairs, 41 based on Foata normal form. 0/10564 useless extension candidates. Maximal degree in co-relation 13484. Up to 197 conditions per place. [2025-02-08 05:38:59,795 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 12 selfloop transitions, 2 changer transitions 0/661 dead transitions. [2025-02-08 05:38:59,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 661 transitions, 1692 flow [2025-02-08 05:38:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2217 transitions. [2025-02-08 05:38:59,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685452162516383 [2025-02-08 05:38:59,797 INFO L175 Difference]: Start difference. First operand has 652 places, 661 transitions, 1663 flow. Second operand 3 states and 2217 transitions. [2025-02-08 05:38:59,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 661 transitions, 1692 flow [2025-02-08 05:38:59,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 661 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:59,806 INFO L231 Difference]: Finished difference. Result has 651 places, 660 transitions, 1661 flow [2025-02-08 05:38:59,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1661, PETRI_PLACES=651, PETRI_TRANSITIONS=660} [2025-02-08 05:38:59,807 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -59 predicate places. [2025-02-08 05:38:59,808 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 660 transitions, 1661 flow [2025-02-08 05:38:59,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 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:38:59,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:59,809 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:38:59,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-08 05:38:59,809 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-02-08 05:38:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1552215124, now seen corresponding path program 1 times [2025-02-08 05:38:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45746308] [2025-02-08 05:38:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:59,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:59,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-08 05:38:59,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-08 05:38:59,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:59,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 05:38:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45746308] [2025-02-08 05:38:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45746308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226967640] [2025-02-08 05:38:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:59,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 763 [2025-02-08 05:38:59,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 660 transitions, 1661 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:38:59,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:59,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 763 [2025-02-08 05:38:59,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:02,196 INFO L124 PetriNetUnfolderBase]: 613/12258 cut-off events. [2025-02-08 05:39:02,197 INFO L125 PetriNetUnfolderBase]: For 200/204 co-relation queries the response was YES. [2025-02-08 05:39:02,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15046 conditions, 12258 events. 613/12258 cut-off events. For 200/204 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 119150 event pairs, 70 based on Foata normal form. 0/11536 useless extension candidates. Maximal degree in co-relation 14818. Up to 307 conditions per place. [2025-02-08 05:39:02,290 INFO L140 encePairwiseOnDemand]: 760/763 looper letters, 0 selfloop transitions, 0 changer transitions 660/660 dead transitions. [2025-02-08 05:39:02,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 660 transitions, 1690 flow [2025-02-08 05:39:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2217 transitions. [2025-02-08 05:39:02,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685452162516383 [2025-02-08 05:39:02,292 INFO L175 Difference]: Start difference. First operand has 651 places, 660 transitions, 1661 flow. Second operand 3 states and 2217 transitions. [2025-02-08 05:39:02,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 660 transitions, 1690 flow [2025-02-08 05:39:02,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 660 transitions, 1686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:02,300 INFO L231 Difference]: Finished difference. Result has 650 places, 0 transitions, 0 flow [2025-02-08 05:39:02,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=763, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=650, PETRI_TRANSITIONS=0} [2025-02-08 05:39:02,300 INFO L279 CegarLoopForPetriNet]: 710 programPoint places, -60 predicate places. [2025-02-08 05:39:02,300 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 0 transitions, 0 flow [2025-02-08 05:39:02,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (189 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (188 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (187 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (186 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (185 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (184 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (183 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (182 of 190 remaining) [2025-02-08 05:39:02,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (181 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (180 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (178 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (177 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (176 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (175 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (174 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (173 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (172 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (171 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (170 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (169 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (168 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (167 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (166 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (165 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (164 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (163 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (162 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (161 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (160 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (159 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (158 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (157 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (156 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (155 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 190 remaining) [2025-02-08 05:39:02,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (152 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (151 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (150 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (149 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (148 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (147 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (146 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (145 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (144 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (143 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (142 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (141 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (140 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (139 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (138 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (137 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (136 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (135 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (133 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (132 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (131 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (130 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (129 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (128 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (126 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (125 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (124 of 190 remaining) [2025-02-08 05:39:02,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (123 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (122 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (121 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (120 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (119 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (118 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (117 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (116 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (111 of 190 remaining) [2025-02-08 05:39:02,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (108 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (107 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (106 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (105 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (101 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (100 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (99 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (98 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (96 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (95 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (94 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (93 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (92 of 190 remaining) [2025-02-08 05:39:02,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (91 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (89 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (85 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (84 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (83 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (82 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (81 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (80 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (79 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (78 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (77 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (76 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (74 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (72 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (70 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (67 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (66 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (63 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (62 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (61 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (60 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (59 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (58 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (56 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (55 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (54 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (53 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (51 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (50 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (49 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (48 of 190 remaining) [2025-02-08 05:39:02,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (42 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (41 of 190 remaining) [2025-02-08 05:39:02,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (40 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (39 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (38 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (37 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (36 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (35 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (34 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (33 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (31 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (29 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (27 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (24 of 190 remaining) [2025-02-08 05:39:02,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (21 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (20 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (19 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (18 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (17 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (16 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (15 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (13 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (10 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (1 of 190 remaining) [2025-02-08 05:39:02,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 190 remaining) [2025-02-08 05:39:02,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-08 05:39:02,312 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,316 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:02,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:02,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:02 BasicIcfg [2025-02-08 05:39:02,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:02,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:02,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:02,321 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:02,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:43" (3/4) ... [2025-02-08 05:39:02,323 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:02,326 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:02,326 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:02,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 05:39:02,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:02,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:02,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:02,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:02,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:02,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:02,413 INFO L158 Benchmark]: Toolchain (without parser) took 79553.52ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 112.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 456.3MB. Max. memory is 16.1GB. [2025-02-08 05:39:02,413 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:02,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:02,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.21ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:02,413 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:02,414 INFO L158 Benchmark]: IcfgBuilder took 748.71ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 49.7MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:39:02,414 INFO L158 Benchmark]: TraceAbstraction took 78392.78ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 49.2MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-02-08 05:39:02,414 INFO L158 Benchmark]: Witness Printer took 90.72ms. Allocated memory is still 3.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:02,415 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.7MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.21ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 748.71ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 49.7MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 78392.78ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 49.2MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 90.72ms. Allocated memory is still 3.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1242 locations, 190 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 78.1s, OverallIterations: 56, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 73.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3431 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 1060 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3676 IncrementalHoareTripleChecker+Invalid, 3980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 791 mSDtfsCounter, 3676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1667occurred in iteration=53, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 11001 NumberOfCodeBlocks, 10956 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 11159 ConstructedInterpolants, 0 QuantifiedInterpolants, 12186 SizeOfPredicates, 5 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 1064/1067 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 102 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:02,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE