./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.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-trans.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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:41,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:41,232 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:41,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:41,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:41,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:41,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:41,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:41,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:41,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:41,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:41,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:41,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:41,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:41,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:41,262 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-02-08 05:37:41,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:41,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:41,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:41,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:41,541 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:41,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-02-08 05:37:42,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e87cd4a21/d088a581ee0342cf8c3b5b1a5c465ba2/FLAGa77f49b38 [2025-02-08 05:37:42,948 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:42,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-02-08 05:37:42,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e87cd4a21/d088a581ee0342cf8c3b5b1a5c465ba2/FLAGa77f49b38 [2025-02-08 05:37:43,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e87cd4a21/d088a581ee0342cf8c3b5b1a5c465ba2 [2025-02-08 05:37:43,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:43,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:43,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:43,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:43,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:43,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:43, skipping insertion in model container [2025-02-08 05:37:43,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:43" (1/1) ... [2025-02-08 05:37:43,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:43,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:43,357 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:43,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:43,460 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:43,460 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,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:43,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:43,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:43,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:43,470 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,493 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,557 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 838 [2025-02-08 05:37:43,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:43,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:43,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:43,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:43,572 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,575 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,584 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,590 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,618 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,619 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,621 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,623 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,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:43,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:43,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:43,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:43,635 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,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:43,659 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,664 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,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:43,699 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,844 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:43,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:44,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:44,222 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:44,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:44,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:44,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-11: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:44,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-7: #t~ite51#1 := #t~ret50#1; [2025-02-08 05:37:44,518 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:44,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:44,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:44,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-11: #t~ret50#1 := minus_#res#1; [2025-02-08 05:37:44,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-7: #t~ite77#1 := #t~ret76#1; [2025-02-08 05:37:44,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret76#1 && #t~ret76#1 <= 2147483647; [2025-02-08 05:37:44,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:44,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:44,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-11: #t~ret76#1 := minus_#res#1; [2025-02-08 05:37:44,843 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:44,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:44,873 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:44,874 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:44,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:44 BoogieIcfgContainer [2025-02-08 05:37:44,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:44,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:44,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:44,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:44,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:43" (1/3) ... [2025-02-08 05:37:44,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf4a4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:44, skipping insertion in model container [2025-02-08 05:37:44,880 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:44,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf4a4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:44, skipping insertion in model container [2025-02-08 05:37:44,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:44" (3/3) ... [2025-02-08 05:37:44,882 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-02-08 05:37:44,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:44,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 1037 locations, 1 initial locations, 4 loop locations, and 149 error locations. [2025-02-08 05:37:44,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:45,109 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1046 places, 1090 transitions, 2201 flow [2025-02-08 05:37:45,638 INFO L124 PetriNetUnfolderBase]: 54/1087 cut-off events. [2025-02-08 05:37:45,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:45,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 1087 events. 54/1087 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3788 event pairs, 0 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 834. Up to 2 conditions per place. [2025-02-08 05:37:45,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 1046 places, 1090 transitions, 2201 flow [2025-02-08 05:37:45,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1024 places, 1066 transitions, 2150 flow [2025-02-08 05:37:45,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:45,715 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;@11b6fcb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:45,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 281 error locations. [2025-02-08 05:37:45,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:45,722 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:37:45,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:45,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:45,723 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] [2025-02-08 05:37:45,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:45,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1950338724, now seen corresponding path program 1 times [2025-02-08 05:37:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575330627] [2025-02-08 05:37:45,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:45,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:37:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:37:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:45,883 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,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575330627] [2025-02-08 05:37:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575330627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955481987] [2025-02-08 05:37:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:45,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:45,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:45,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:37:45,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1066 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:45,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:37:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:47,447 INFO L124 PetriNetUnfolderBase]: 212/4316 cut-off events. [2025-02-08 05:37:47,448 INFO L125 PetriNetUnfolderBase]: For 59/66 co-relation queries the response was YES. [2025-02-08 05:37:47,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 4316 events. 212/4316 cut-off events. For 59/66 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 33065 event pairs, 45 based on Foata normal form. 207/3607 useless extension candidates. Maximal degree in co-relation 3671. Up to 110 conditions per place. [2025-02-08 05:37:47,583 INFO L140 encePairwiseOnDemand]: 1070/1090 looper letters, 19 selfloop transitions, 2 changer transitions 2/1048 dead transitions. [2025-02-08 05:37:47,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1048 transitions, 2156 flow [2025-02-08 05:37:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3183 transitions. [2025-02-08 05:37:47,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9733944954128441 [2025-02-08 05:37:47,607 INFO L175 Difference]: Start difference. First operand has 1024 places, 1066 transitions, 2150 flow. Second operand 3 states and 3183 transitions. [2025-02-08 05:37:47,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1048 transitions, 2156 flow [2025-02-08 05:37:47,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1048 transitions, 2144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:47,628 INFO L231 Difference]: Finished difference. Result has 1019 places, 1046 transitions, 2102 flow [2025-02-08 05:37:47,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1019, PETRI_TRANSITIONS=1046} [2025-02-08 05:37:47,633 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -5 predicate places. [2025-02-08 05:37:47,635 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1046 transitions, 2102 flow [2025-02-08 05:37:47,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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 L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:47,637 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] [2025-02-08 05:37:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:47,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:47,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1817750260, now seen corresponding path program 1 times [2025-02-08 05:37:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412826614] [2025-02-08 05:37:47,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:47,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:37:47,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:37:47,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:47,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:47,709 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,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:47,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412826614] [2025-02-08 05:37:47,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412826614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:47,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:47,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837306842] [2025-02-08 05:37:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:47,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:47,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:47,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:47,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:47,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:37:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:37:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,305 INFO L124 PetriNetUnfolderBase]: 570/11960 cut-off events. [2025-02-08 05:37:50,306 INFO L125 PetriNetUnfolderBase]: For 6/24 co-relation queries the response was YES. [2025-02-08 05:37:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12194 conditions, 11960 events. 570/11960 cut-off events. For 6/24 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 118652 event pairs, 95 based on Foata normal form. 0/9347 useless extension candidates. Maximal degree in co-relation 12153. Up to 185 conditions per place. [2025-02-08 05:37:50,502 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 19 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2025-02-08 05:37:50,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1045 transitions, 2142 flow [2025-02-08 05:37:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:37:50,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681957186544342 [2025-02-08 05:37:50,605 INFO L175 Difference]: Start difference. First operand has 1019 places, 1046 transitions, 2102 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:37:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1045 transitions, 2142 flow [2025-02-08 05:37:50,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1045 transitions, 2138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:50,617 INFO L231 Difference]: Finished difference. Result has 1016 places, 1045 transitions, 2100 flow [2025-02-08 05:37:50,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1043, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=1016, PETRI_TRANSITIONS=1045} [2025-02-08 05:37:50,620 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -8 predicate places. [2025-02-08 05:37:50,620 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1045 transitions, 2100 flow [2025-02-08 05:37:50,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,622 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] [2025-02-08 05:37:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:50,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1475200569, now seen corresponding path program 1 times [2025-02-08 05:37:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-02-08 05:37:50,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:37:50,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:37:50,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,690 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,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-02-08 05:37:50,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546911668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379557500] [2025-02-08 05:37:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:37:50,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1045 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:37:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,890 INFO L124 PetriNetUnfolderBase]: 229/3513 cut-off events. [2025-02-08 05:37:51,890 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-02-08 05:37:51,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 3513 events. 229/3513 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 26729 event pairs, 95 based on Foata normal form. 0/2772 useless extension candidates. Maximal degree in co-relation 3663. Up to 185 conditions per place. [2025-02-08 05:37:52,016 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 19 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2025-02-08 05:37:52,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1044 transitions, 2140 flow [2025-02-08 05:37:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:37:52,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681957186544342 [2025-02-08 05:37:52,023 INFO L175 Difference]: Start difference. First operand has 1016 places, 1045 transitions, 2100 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:37:52,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1044 transitions, 2140 flow [2025-02-08 05:37:52,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1044 transitions, 2136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,037 INFO L231 Difference]: Finished difference. Result has 1015 places, 1044 transitions, 2098 flow [2025-02-08 05:37:52,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=1015, PETRI_TRANSITIONS=1044} [2025-02-08 05:37:52,039 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -9 predicate places. [2025-02-08 05:37:52,039 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1044 transitions, 2098 flow [2025-02-08 05:37:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1049.3333333333333) internal successors, (3148), 3 states have internal predecessors, (3148), 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,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,041 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] [2025-02-08 05:37:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:52,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 418653473, now seen corresponding path program 1 times [2025-02-08 05:37:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064519575] [2025-02-08 05:37:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:37:52,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:37:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,097 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,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064519575] [2025-02-08 05:37:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064519575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269675119] [2025-02-08 05:37:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1090 [2025-02-08 05:37:52,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1044 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1090 [2025-02-08 05:37:52,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,568 INFO L124 PetriNetUnfolderBase]: 227/5403 cut-off events. [2025-02-08 05:37:53,568 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 5403 events. 227/5403 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 42789 event pairs, 16 based on Foata normal form. 0/4251 useless extension candidates. Maximal degree in co-relation 5422. Up to 51 conditions per place. [2025-02-08 05:37:53,716 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 18 selfloop transitions, 2 changer transitions 0/1043 dead transitions. [2025-02-08 05:37:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1043 transitions, 2136 flow [2025-02-08 05:37:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:37:53,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:37:53,721 INFO L175 Difference]: Start difference. First operand has 1015 places, 1044 transitions, 2098 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:37:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1043 transitions, 2136 flow [2025-02-08 05:37:53,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1043 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,731 INFO L231 Difference]: Finished difference. Result has 1014 places, 1043 transitions, 2096 flow [2025-02-08 05:37:53,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=1014, PETRI_TRANSITIONS=1043} [2025-02-08 05:37:53,733 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -10 predicate places. [2025-02-08 05:37:53,733 INFO L471 AbstractCegarLoop]: Abstraction has has 1014 places, 1043 transitions, 2096 flow [2025-02-08 05:37:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,734 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] [2025-02-08 05:37:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:53,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1712369734, now seen corresponding path program 1 times [2025-02-08 05:37:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772288794] [2025-02-08 05:37:53,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:37:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:37:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,763 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,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772288794] [2025-02-08 05:37:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772288794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137286997] [2025-02-08 05:37:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1090 [2025-02-08 05:37:53,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 1043 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1090 [2025-02-08 05:37:53,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,067 INFO L124 PetriNetUnfolderBase]: 69/1582 cut-off events. [2025-02-08 05:37:54,067 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:54,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1582 events. 69/1582 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8080 event pairs, 12 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 1578. Up to 40 conditions per place. [2025-02-08 05:37:54,126 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 15 selfloop transitions, 2 changer transitions 0/1042 dead transitions. [2025-02-08 05:37:54,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1042 transitions, 2128 flow [2025-02-08 05:37:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3174 transitions. [2025-02-08 05:37:54,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706422018348624 [2025-02-08 05:37:54,131 INFO L175 Difference]: Start difference. First operand has 1014 places, 1043 transitions, 2096 flow. Second operand 3 states and 3174 transitions. [2025-02-08 05:37:54,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1042 transitions, 2128 flow [2025-02-08 05:37:54,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 1042 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,141 INFO L231 Difference]: Finished difference. Result has 1013 places, 1042 transitions, 2094 flow [2025-02-08 05:37:54,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=1013, PETRI_TRANSITIONS=1042} [2025-02-08 05:37:54,143 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -11 predicate places. [2025-02-08 05:37:54,143 INFO L471 AbstractCegarLoop]: Abstraction has has 1013 places, 1042 transitions, 2094 flow [2025-02-08 05:37:54,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,145 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] [2025-02-08 05:37:54,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:54,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1542514144, now seen corresponding path program 1 times [2025-02-08 05:37:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206004687] [2025-02-08 05:37:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:37:54,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:37:54,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,175 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,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206004687] [2025-02-08 05:37:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206004687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746368710] [2025-02-08 05:37:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1053 out of 1090 [2025-02-08 05:37:54,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1042 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1053 of 1090 [2025-02-08 05:37:54,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,870 INFO L124 PetriNetUnfolderBase]: 155/3766 cut-off events. [2025-02-08 05:37:54,870 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:37:54,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 3766 events. 155/3766 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25506 event pairs, 10 based on Foata normal form. 0/2977 useless extension candidates. Maximal degree in co-relation 3747. Up to 35 conditions per place. [2025-02-08 05:37:55,010 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 14 selfloop transitions, 2 changer transitions 0/1041 dead transitions. [2025-02-08 05:37:55,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 1041 transitions, 2124 flow [2025-02-08 05:37:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3176 transitions. [2025-02-08 05:37:55,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712538226299694 [2025-02-08 05:37:55,016 INFO L175 Difference]: Start difference. First operand has 1013 places, 1042 transitions, 2094 flow. Second operand 3 states and 3176 transitions. [2025-02-08 05:37:55,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 1041 transitions, 2124 flow [2025-02-08 05:37:55,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1041 transitions, 2120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,026 INFO L231 Difference]: Finished difference. Result has 1012 places, 1041 transitions, 2092 flow [2025-02-08 05:37:55,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1012, PETRI_TRANSITIONS=1041} [2025-02-08 05:37:55,027 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -12 predicate places. [2025-02-08 05:37:55,027 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1041 transitions, 2092 flow [2025-02-08 05:37:55,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,029 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] [2025-02-08 05:37:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:55,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1455607204, now seen corresponding path program 1 times [2025-02-08 05:37:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-02-08 05:37:55,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:37:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:37:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,059 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,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-02-08 05:37:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587340362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124130086] [2025-02-08 05:37:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1046 out of 1090 [2025-02-08 05:37:55,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1041 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1046 of 1090 [2025-02-08 05:37:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,828 INFO L124 PetriNetUnfolderBase]: 323/7580 cut-off events. [2025-02-08 05:37:56,829 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:57,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7683 conditions, 7580 events. 323/7580 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 66952 event pairs, 24 based on Foata normal form. 0/5957 useless extension candidates. Maximal degree in co-relation 7602. Up to 70 conditions per place. [2025-02-08 05:37:57,107 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 21 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-02-08 05:37:57,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1040 transitions, 2136 flow [2025-02-08 05:37:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3162 transitions. [2025-02-08 05:37:57,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9669724770642202 [2025-02-08 05:37:57,111 INFO L175 Difference]: Start difference. First operand has 1012 places, 1041 transitions, 2092 flow. Second operand 3 states and 3162 transitions. [2025-02-08 05:37:57,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1040 transitions, 2136 flow [2025-02-08 05:37:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1040 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:57,373 INFO L231 Difference]: Finished difference. Result has 1011 places, 1040 transitions, 2090 flow [2025-02-08 05:37:57,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=1011, PETRI_TRANSITIONS=1040} [2025-02-08 05:37:57,377 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -13 predicate places. [2025-02-08 05:37:57,377 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1040 transitions, 2090 flow [2025-02-08 05:37:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:57,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:57,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2062640652, now seen corresponding path program 1 times [2025-02-08 05:37:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796830860] [2025-02-08 05:37:57,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:57,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:57,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:57,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:57,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:57,484 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,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796830860] [2025-02-08 05:37:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796830860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991926234] [2025-02-08 05:37:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:57,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:57,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1090 [2025-02-08 05:37:57,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1040 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:57,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1090 [2025-02-08 05:37:57,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:58,497 INFO L124 PetriNetUnfolderBase]: 139/3223 cut-off events. [2025-02-08 05:37:58,498 INFO L125 PetriNetUnfolderBase]: For 9/33 co-relation queries the response was YES. [2025-02-08 05:37:58,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3291 conditions, 3223 events. 139/3223 cut-off events. For 9/33 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21126 event pairs, 16 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 3202. Up to 51 conditions per place. [2025-02-08 05:37:58,656 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 18 selfloop transitions, 2 changer transitions 0/1039 dead transitions. [2025-02-08 05:37:58,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1039 transitions, 2128 flow [2025-02-08 05:37:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:37:58,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:37:58,661 INFO L175 Difference]: Start difference. First operand has 1011 places, 1040 transitions, 2090 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:37:58,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1039 transitions, 2128 flow [2025-02-08 05:37:58,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1039 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:58,694 INFO L231 Difference]: Finished difference. Result has 1010 places, 1039 transitions, 2088 flow [2025-02-08 05:37:58,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1039, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1010, PETRI_TRANSITIONS=1039} [2025-02-08 05:37:58,699 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -14 predicate places. [2025-02-08 05:37:58,699 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1039 transitions, 2088 flow [2025-02-08 05:37:58,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:58,705 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] [2025-02-08 05:37:58,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:58,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash 370772536, now seen corresponding path program 1 times [2025-02-08 05:37:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924158037] [2025-02-08 05:37:58,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:37:58,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:37:58,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,757 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,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924158037] [2025-02-08 05:37:58,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924158037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560770037] [2025-02-08 05:37:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1090 [2025-02-08 05:37:58,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1039 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1090 [2025-02-08 05:37:58,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:59,276 INFO L124 PetriNetUnfolderBase]: 69/1578 cut-off events. [2025-02-08 05:37:59,277 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-02-08 05:37:59,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 1578 events. 69/1578 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7640 event pairs, 12 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1536. Up to 40 conditions per place. [2025-02-08 05:37:59,356 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 15 selfloop transitions, 2 changer transitions 0/1038 dead transitions. [2025-02-08 05:37:59,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 1038 transitions, 2120 flow [2025-02-08 05:37:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3174 transitions. [2025-02-08 05:37:59,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706422018348624 [2025-02-08 05:37:59,361 INFO L175 Difference]: Start difference. First operand has 1010 places, 1039 transitions, 2088 flow. Second operand 3 states and 3174 transitions. [2025-02-08 05:37:59,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 1038 transitions, 2120 flow [2025-02-08 05:37:59,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1038 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:59,374 INFO L231 Difference]: Finished difference. Result has 1009 places, 1038 transitions, 2086 flow [2025-02-08 05:37:59,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=1009, PETRI_TRANSITIONS=1038} [2025-02-08 05:37:59,376 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -15 predicate places. [2025-02-08 05:37:59,376 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1038 transitions, 2086 flow [2025-02-08 05:37:59,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:59,378 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] [2025-02-08 05:37:59,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:59,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:37:59,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1541311426, now seen corresponding path program 1 times [2025-02-08 05:37:59,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321343444] [2025-02-08 05:37:59,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:59,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:37:59,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:37:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:59,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:59,414 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,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321343444] [2025-02-08 05:37:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321343444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087221621] [2025-02-08 05:37:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:59,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1053 out of 1090 [2025-02-08 05:37:59,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1038 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:59,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1053 of 1090 [2025-02-08 05:37:59,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:00,156 INFO L124 PetriNetUnfolderBase]: 100/2402 cut-off events. [2025-02-08 05:38:00,157 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:38:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 2402 events. 100/2402 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13383 event pairs, 10 based on Foata normal form. 0/1915 useless extension candidates. Maximal degree in co-relation 2346. Up to 35 conditions per place. [2025-02-08 05:38:00,254 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 14 selfloop transitions, 2 changer transitions 0/1037 dead transitions. [2025-02-08 05:38:00,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 1037 transitions, 2116 flow [2025-02-08 05:38:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3176 transitions. [2025-02-08 05:38:00,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712538226299694 [2025-02-08 05:38:00,258 INFO L175 Difference]: Start difference. First operand has 1009 places, 1038 transitions, 2086 flow. Second operand 3 states and 3176 transitions. [2025-02-08 05:38:00,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 1037 transitions, 2116 flow [2025-02-08 05:38:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 1037 transitions, 2112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:00,268 INFO L231 Difference]: Finished difference. Result has 1008 places, 1037 transitions, 2084 flow [2025-02-08 05:38:00,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1008, PETRI_TRANSITIONS=1037} [2025-02-08 05:38:00,270 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -16 predicate places. [2025-02-08 05:38:00,270 INFO L471 AbstractCegarLoop]: Abstraction has has 1008 places, 1037 transitions, 2084 flow [2025-02-08 05:38:00,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:00,272 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] [2025-02-08 05:38:00,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:00,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash 271019791, now seen corresponding path program 1 times [2025-02-08 05:38:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:00,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163838983] [2025-02-08 05:38:00,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:00,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:38:00,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:38:00,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:00,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163838983] [2025-02-08 05:38:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163838983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:00,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652911044] [2025-02-08 05:38:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:00,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:00,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1046 out of 1090 [2025-02-08 05:38:00,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 1037 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:00,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1046 of 1090 [2025-02-08 05:38:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:01,438 INFO L124 PetriNetUnfolderBase]: 191/4312 cut-off events. [2025-02-08 05:38:01,438 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2025-02-08 05:38:01,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 4312 events. 191/4312 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31720 event pairs, 24 based on Foata normal form. 0/3401 useless extension candidates. Maximal degree in co-relation 4290. Up to 70 conditions per place. [2025-02-08 05:38:01,674 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 21 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2025-02-08 05:38:01,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1036 transitions, 2128 flow [2025-02-08 05:38:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3162 transitions. [2025-02-08 05:38:01,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9669724770642202 [2025-02-08 05:38:01,678 INFO L175 Difference]: Start difference. First operand has 1008 places, 1037 transitions, 2084 flow. Second operand 3 states and 3162 transitions. [2025-02-08 05:38:01,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1036 transitions, 2128 flow [2025-02-08 05:38:01,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1036 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:01,688 INFO L231 Difference]: Finished difference. Result has 1007 places, 1036 transitions, 2082 flow [2025-02-08 05:38:01,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2082, PETRI_PLACES=1007, PETRI_TRANSITIONS=1036} [2025-02-08 05:38:01,690 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -17 predicate places. [2025-02-08 05:38:01,690 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 1036 transitions, 2082 flow [2025-02-08 05:38:01,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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:01,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:01,692 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] [2025-02-08 05:38:01,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:01,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:01,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1136178252, now seen corresponding path program 1 times [2025-02-08 05:38:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465040743] [2025-02-08 05:38:01,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:01,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:38:01,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:38:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:01,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:01,721 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:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465040743] [2025-02-08 05:38:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465040743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512782483] [2025-02-08 05:38:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:01,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:01,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:01,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1090 [2025-02-08 05:38:01,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1036 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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:01,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:01,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1090 [2025-02-08 05:38:01,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,016 INFO L124 PetriNetUnfolderBase]: 73/1543 cut-off events. [2025-02-08 05:38:02,016 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-02-08 05:38:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1543 events. 73/1543 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7307 event pairs, 16 based on Foata normal form. 0/1247 useless extension candidates. Maximal degree in co-relation 1484. Up to 53 conditions per place. [2025-02-08 05:38:02,065 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 18 selfloop transitions, 2 changer transitions 0/1035 dead transitions. [2025-02-08 05:38:02,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1035 transitions, 2120 flow [2025-02-08 05:38:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:38:02,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:38:02,068 INFO L175 Difference]: Start difference. First operand has 1007 places, 1036 transitions, 2082 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:38:02,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 1035 transitions, 2120 flow [2025-02-08 05:38:02,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1006 places, 1035 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,077 INFO L231 Difference]: Finished difference. Result has 1006 places, 1035 transitions, 2080 flow [2025-02-08 05:38:02,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=1006, PETRI_TRANSITIONS=1035} [2025-02-08 05:38:02,079 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -18 predicate places. [2025-02-08 05:38:02,079 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1035 transitions, 2080 flow [2025-02-08 05:38:02,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,080 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] [2025-02-08 05:38:02,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:02,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1783801136, now seen corresponding path program 1 times [2025-02-08 05:38:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733700758] [2025-02-08 05:38:02,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 05:38:02,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 05:38:02,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,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:38:02,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733700758] [2025-02-08 05:38:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733700758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452455287] [2025-02-08 05:38:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1052 out of 1090 [2025-02-08 05:38:02,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1035 transitions, 2080 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1052 of 1090 [2025-02-08 05:38:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,400 INFO L124 PetriNetUnfolderBase]: 69/1574 cut-off events. [2025-02-08 05:38:02,401 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-02-08 05:38:02,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 1574 events. 69/1574 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7132 event pairs, 12 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 1494. Up to 40 conditions per place. [2025-02-08 05:38:02,440 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 15 selfloop transitions, 2 changer transitions 0/1034 dead transitions. [2025-02-08 05:38:02,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1034 transitions, 2112 flow [2025-02-08 05:38:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3174 transitions. [2025-02-08 05:38:02,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706422018348624 [2025-02-08 05:38:02,444 INFO L175 Difference]: Start difference. First operand has 1006 places, 1035 transitions, 2080 flow. Second operand 3 states and 3174 transitions. [2025-02-08 05:38:02,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1034 transitions, 2112 flow [2025-02-08 05:38:02,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1034 transitions, 2108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,452 INFO L231 Difference]: Finished difference. Result has 1005 places, 1034 transitions, 2078 flow [2025-02-08 05:38:02,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=1005, PETRI_TRANSITIONS=1034} [2025-02-08 05:38:02,454 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -19 predicate places. [2025-02-08 05:38:02,454 INFO L471 AbstractCegarLoop]: Abstraction has has 1005 places, 1034 transitions, 2078 flow [2025-02-08 05:38:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,455 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] [2025-02-08 05:38:02,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:02,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1219588451, now seen corresponding path program 1 times [2025-02-08 05:38:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521078765] [2025-02-08 05:38:02,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:38:02,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:38:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,483 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,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521078765] [2025-02-08 05:38:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521078765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268626929] [2025-02-08 05:38:02,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1053 out of 1090 [2025-02-08 05:38:02,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 1034 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1053 of 1090 [2025-02-08 05:38:02,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,676 INFO L124 PetriNetUnfolderBase]: 45/1053 cut-off events. [2025-02-08 05:38:02,677 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:38:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1053 events. 45/1053 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4280 event pairs, 10 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 960. Up to 35 conditions per place. [2025-02-08 05:38:02,712 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 14 selfloop transitions, 2 changer transitions 0/1033 dead transitions. [2025-02-08 05:38:02,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 1033 transitions, 2108 flow [2025-02-08 05:38:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3176 transitions. [2025-02-08 05:38:02,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712538226299694 [2025-02-08 05:38:02,716 INFO L175 Difference]: Start difference. First operand has 1005 places, 1034 transitions, 2078 flow. Second operand 3 states and 3176 transitions. [2025-02-08 05:38:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 1033 transitions, 2108 flow [2025-02-08 05:38:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1033 transitions, 2104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,725 INFO L231 Difference]: Finished difference. Result has 1004 places, 1033 transitions, 2076 flow [2025-02-08 05:38:02,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2076, PETRI_PLACES=1004, PETRI_TRANSITIONS=1033} [2025-02-08 05:38:02,727 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -20 predicate places. [2025-02-08 05:38:02,727 INFO L471 AbstractCegarLoop]: Abstraction has has 1004 places, 1033 transitions, 2076 flow [2025-02-08 05:38:02,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1054.3333333333333) internal successors, (3163), 3 states have internal predecessors, (3163), 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,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:02,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:02,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1228582960, now seen corresponding path program 1 times [2025-02-08 05:38:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976498110] [2025-02-08 05:38:02,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:38:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:38:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,758 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,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976498110] [2025-02-08 05:38:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976498110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143321848] [2025-02-08 05:38:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1046 out of 1090 [2025-02-08 05:38:02,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 1033 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1046 of 1090 [2025-02-08 05:38:02,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,057 INFO L124 PetriNetUnfolderBase]: 81/1572 cut-off events. [2025-02-08 05:38:03,057 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-02-08 05:38:03,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 1572 events. 81/1572 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8113 event pairs, 24 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 1506. Up to 70 conditions per place. [2025-02-08 05:38:03,106 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 21 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2025-02-08 05:38:03,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 1032 transitions, 2120 flow [2025-02-08 05:38:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3162 transitions. [2025-02-08 05:38:03,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9669724770642202 [2025-02-08 05:38:03,110 INFO L175 Difference]: Start difference. First operand has 1004 places, 1033 transitions, 2076 flow. Second operand 3 states and 3162 transitions. [2025-02-08 05:38:03,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 1032 transitions, 2120 flow [2025-02-08 05:38:03,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1032 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:03,119 INFO L231 Difference]: Finished difference. Result has 1003 places, 1032 transitions, 2074 flow [2025-02-08 05:38:03,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2074, PETRI_PLACES=1003, PETRI_TRANSITIONS=1032} [2025-02-08 05:38:03,120 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -21 predicate places. [2025-02-08 05:38:03,121 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1032 transitions, 2074 flow [2025-02-08 05:38:03,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 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:03,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,121 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:38:03,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:03,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash -572829507, now seen corresponding path program 1 times [2025-02-08 05:38:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607612638] [2025-02-08 05:38:03,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:38:03,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:38:03,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:03,160 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:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:03,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607612638] [2025-02-08 05:38:03,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607612638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:03,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:03,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562035] [2025-02-08 05:38:03,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:03,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:03,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:03,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:03,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1090 [2025-02-08 05:38:03,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1032 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:03,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:03,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1090 [2025-02-08 05:38:03,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,586 INFO L124 PetriNetUnfolderBase]: 113/2562 cut-off events. [2025-02-08 05:38:03,586 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:38:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 2562 events. 113/2562 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14107 event pairs, 15 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 2465. Up to 43 conditions per place. [2025-02-08 05:38:03,674 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 12 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-02-08 05:38:03,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 1031 transitions, 2100 flow [2025-02-08 05:38:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3180 transitions. [2025-02-08 05:38:03,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724770642201835 [2025-02-08 05:38:03,678 INFO L175 Difference]: Start difference. First operand has 1003 places, 1032 transitions, 2074 flow. Second operand 3 states and 3180 transitions. [2025-02-08 05:38:03,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 1031 transitions, 2100 flow [2025-02-08 05:38:03,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 1031 transitions, 2096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:03,687 INFO L231 Difference]: Finished difference. Result has 1002 places, 1031 transitions, 2072 flow [2025-02-08 05:38:03,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1031, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2072, PETRI_PLACES=1002, PETRI_TRANSITIONS=1031} [2025-02-08 05:38:03,688 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -22 predicate places. [2025-02-08 05:38:03,688 INFO L471 AbstractCegarLoop]: Abstraction has has 1002 places, 1031 transitions, 2072 flow [2025-02-08 05:38:03,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:03,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,689 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:38:03,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:03,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -935064047, now seen corresponding path program 1 times [2025-02-08 05:38:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-02-08 05:38:03,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:38:03,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:38:03,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,078 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,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-02-08 05:38:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223291006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613168280] [2025-02-08 05:38:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:04,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:04,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1039 out of 1090 [2025-02-08 05:38:04,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 1031 transitions, 2072 flow. Second operand has 6 states, 6 states have (on average 1040.5) internal successors, (6243), 6 states have internal predecessors, (6243), 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,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1039 of 1090 [2025-02-08 05:38:04,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,382 INFO L124 PetriNetUnfolderBase]: 840/12516 cut-off events. [2025-02-08 05:38:06,382 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2025-02-08 05:38:06,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13136 conditions, 12516 events. 840/12516 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 129577 event pairs, 264 based on Foata normal form. 0/9788 useless extension candidates. Maximal degree in co-relation 12924. Up to 580 conditions per place. [2025-02-08 05:38:06,777 INFO L140 encePairwiseOnDemand]: 1084/1090 looper letters, 26 selfloop transitions, 5 changer transitions 0/1030 dead transitions. [2025-02-08 05:38:06,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 1030 transitions, 2132 flow [2025-02-08 05:38:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6266 transitions. [2025-02-08 05:38:06,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581039755351682 [2025-02-08 05:38:06,783 INFO L175 Difference]: Start difference. First operand has 1002 places, 1031 transitions, 2072 flow. Second operand 6 states and 6266 transitions. [2025-02-08 05:38:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 1030 transitions, 2132 flow [2025-02-08 05:38:06,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1030 transitions, 2128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:06,790 INFO L231 Difference]: Finished difference. Result has 1004 places, 1030 transitions, 2076 flow [2025-02-08 05:38:06,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2076, PETRI_PLACES=1004, PETRI_TRANSITIONS=1030} [2025-02-08 05:38:06,791 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -20 predicate places. [2025-02-08 05:38:06,791 INFO L471 AbstractCegarLoop]: Abstraction has has 1004 places, 1030 transitions, 2076 flow [2025-02-08 05:38:06,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1040.5) internal successors, (6243), 6 states have internal predecessors, (6243), 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,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:06,793 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] [2025-02-08 05:38:06,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:06,793 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash -772430471, now seen corresponding path program 1 times [2025-02-08 05:38:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468600098] [2025-02-08 05:38:06,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:06,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:38:06,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:38:06,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:06,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:06,848 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:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468600098] [2025-02-08 05:38:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468600098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370136023] [2025-02-08 05:38:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:06,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:06,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:06,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1090 [2025-02-08 05:38:06,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 1030 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 1055.6666666666667) internal successors, (3167), 3 states have internal predecessors, (3167), 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,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:06,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1090 [2025-02-08 05:38:06,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,679 INFO L124 PetriNetUnfolderBase]: 152/3475 cut-off events. [2025-02-08 05:38:07,679 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:38:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 3475 events. 152/3475 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22368 event pairs, 9 based on Foata normal form. 0/2758 useless extension candidates. Maximal degree in co-relation 3538. Up to 43 conditions per place. [2025-02-08 05:38:07,841 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 16 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-02-08 05:38:07,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 1031 transitions, 2116 flow [2025-02-08 05:38:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3181 transitions. [2025-02-08 05:38:07,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972782874617737 [2025-02-08 05:38:07,845 INFO L175 Difference]: Start difference. First operand has 1004 places, 1030 transitions, 2076 flow. Second operand 3 states and 3181 transitions. [2025-02-08 05:38:07,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 1031 transitions, 2116 flow [2025-02-08 05:38:07,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2106 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:07,853 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2068 flow [2025-02-08 05:38:07,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2068, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2025-02-08 05:38:07,854 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -24 predicate places. [2025-02-08 05:38:07,854 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2068 flow [2025-02-08 05:38:07,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1055.6666666666667) internal successors, (3167), 3 states have internal predecessors, (3167), 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:07,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,855 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] [2025-02-08 05:38:07,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:07,855 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:07,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash -124402463, now seen corresponding path program 1 times [2025-02-08 05:38:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-02-08 05:38:07,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:38:07,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:38:07,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,886 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:07,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-02-08 05:38:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065455591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729456702] [2025-02-08 05:38:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:07,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2068 flow. Second operand has 3 states, 3 states have (on average 1049.6666666666667) internal successors, (3149), 3 states have internal predecessors, (3149), 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:07,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,272 INFO L124 PetriNetUnfolderBase]: 109/2115 cut-off events. [2025-02-08 05:38:08,273 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:08,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 2115 events. 109/2115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12955 event pairs, 26 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 2023. Up to 73 conditions per place. [2025-02-08 05:38:08,346 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 22 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2025-02-08 05:38:08,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2120 flow [2025-02-08 05:38:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3169 transitions. [2025-02-08 05:38:08,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691131498470948 [2025-02-08 05:38:08,349 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2068 flow. Second operand 3 states and 3169 transitions. [2025-02-08 05:38:08,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2120 flow [2025-02-08 05:38:08,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:08,359 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2066 flow [2025-02-08 05:38:08,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2066, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2025-02-08 05:38:08,360 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -25 predicate places. [2025-02-08 05:38:08,360 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2066 flow [2025-02-08 05:38:08,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1049.6666666666667) internal successors, (3149), 3 states have internal predecessors, (3149), 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,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 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,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:08,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:08,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 970758869, now seen corresponding path program 1 times [2025-02-08 05:38:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626936977] [2025-02-08 05:38:08,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 05:38:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 05:38:08,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,395 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:08,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626936977] [2025-02-08 05:38:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626936977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773614612] [2025-02-08 05:38:08,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:08,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1090 [2025-02-08 05:38:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1090 [2025-02-08 05:38:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,776 INFO L124 PetriNetUnfolderBase]: 86/1842 cut-off events. [2025-02-08 05:38:08,776 INFO L125 PetriNetUnfolderBase]: For 11/37 co-relation queries the response was YES. [2025-02-08 05:38:08,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1842 events. 86/1842 cut-off events. For 11/37 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9951 event pairs, 4 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1694. Up to 43 conditions per place. [2025-02-08 05:38:08,863 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 16 selfloop transitions, 2 changer transitions 0/1029 dead transitions. [2025-02-08 05:38:08,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1029 transitions, 2106 flow [2025-02-08 05:38:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3181 transitions. [2025-02-08 05:38:08,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972782874617737 [2025-02-08 05:38:08,865 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2066 flow. Second operand 3 states and 3181 transitions. [2025-02-08 05:38:08,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1029 transitions, 2106 flow [2025-02-08 05:38:08,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1029 transitions, 2102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:08,874 INFO L231 Difference]: Finished difference. Result has 998 places, 1027 transitions, 2064 flow [2025-02-08 05:38:08,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2064, PETRI_PLACES=998, PETRI_TRANSITIONS=1027} [2025-02-08 05:38:08,875 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -26 predicate places. [2025-02-08 05:38:08,875 INFO L471 AbstractCegarLoop]: Abstraction has has 998 places, 1027 transitions, 2064 flow [2025-02-08 05:38:08,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.0) internal successors, (3168), 3 states have internal predecessors, (3168), 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,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,876 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] [2025-02-08 05:38:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:08,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 485160030, now seen corresponding path program 1 times [2025-02-08 05:38:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370798822] [2025-02-08 05:38:08,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:38:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:38:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,910 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:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370798822] [2025-02-08 05:38:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370798822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466540757] [2025-02-08 05:38:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:08,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1090 [2025-02-08 05:38:08,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1027 transitions, 2064 flow. Second operand has 3 states, 3 states have (on average 1035.3333333333333) internal successors, (3106), 3 states have internal predecessors, (3106), 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,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:08,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1090 [2025-02-08 05:38:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:10,241 INFO L124 PetriNetUnfolderBase]: 418/6138 cut-off events. [2025-02-08 05:38:10,242 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:38:10,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 6138 events. 418/6138 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 50418 event pairs, 110 based on Foata normal form. 0/4896 useless extension candidates. Maximal degree in co-relation 5996. Up to 335 conditions per place. [2025-02-08 05:38:10,547 INFO L140 encePairwiseOnDemand]: 1078/1090 looper letters, 29 selfloop transitions, 2 changer transitions 0/1021 dead transitions. [2025-02-08 05:38:10,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 1021 transitions, 2116 flow [2025-02-08 05:38:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3143 transitions. [2025-02-08 05:38:10,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611620795107033 [2025-02-08 05:38:10,549 INFO L175 Difference]: Start difference. First operand has 998 places, 1027 transitions, 2064 flow. Second operand 3 states and 3143 transitions. [2025-02-08 05:38:10,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 1021 transitions, 2116 flow [2025-02-08 05:38:10,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1021 transitions, 2112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:10,558 INFO L231 Difference]: Finished difference. Result has 989 places, 1019 transitions, 2054 flow [2025-02-08 05:38:10,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2054, PETRI_PLACES=989, PETRI_TRANSITIONS=1019} [2025-02-08 05:38:10,560 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -35 predicate places. [2025-02-08 05:38:10,560 INFO L471 AbstractCegarLoop]: Abstraction has has 989 places, 1019 transitions, 2054 flow [2025-02-08 05:38:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.3333333333333) internal successors, (3106), 3 states have internal predecessors, (3106), 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,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:10,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1912576737, now seen corresponding path program 1 times [2025-02-08 05:38:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859459962] [2025-02-08 05:38:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:10,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 05:38:10,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 05:38:10,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:10,591 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:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859459962] [2025-02-08 05:38:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859459962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:10,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:10,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954524139] [2025-02-08 05:38:10,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:10,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:10,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:10,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:10,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1090 [2025-02-08 05:38:10,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 1019 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 1035.3333333333333) internal successors, (3106), 3 states have internal predecessors, (3106), 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,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:10,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1090 [2025-02-08 05:38:10,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:12,460 INFO L124 PetriNetUnfolderBase]: 819/10431 cut-off events. [2025-02-08 05:38:12,460 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:38:12,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11233 conditions, 10431 events. 819/10431 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 99457 event pairs, 190 based on Foata normal form. 0/8359 useless extension candidates. Maximal degree in co-relation 10762. Up to 656 conditions per place. [2025-02-08 05:38:12,786 INFO L140 encePairwiseOnDemand]: 1078/1090 looper letters, 29 selfloop transitions, 2 changer transitions 0/1013 dead transitions. [2025-02-08 05:38:12,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 1013 transitions, 2106 flow [2025-02-08 05:38:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3143 transitions. [2025-02-08 05:38:12,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611620795107033 [2025-02-08 05:38:12,789 INFO L175 Difference]: Start difference. First operand has 989 places, 1019 transitions, 2054 flow. Second operand 3 states and 3143 transitions. [2025-02-08 05:38:12,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 1013 transitions, 2106 flow [2025-02-08 05:38:12,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1013 transitions, 2106 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:12,797 INFO L231 Difference]: Finished difference. Result has 982 places, 1011 transitions, 2048 flow [2025-02-08 05:38:12,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2048, PETRI_PLACES=982, PETRI_TRANSITIONS=1011} [2025-02-08 05:38:12,798 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -42 predicate places. [2025-02-08 05:38:12,798 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1011 transitions, 2048 flow [2025-02-08 05:38:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.3333333333333) internal successors, (3106), 3 states have internal predecessors, (3106), 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:12,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:12,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, 1, 1, 1, 1, 1, 1, 1, 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:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:12,799 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1345750549, now seen corresponding path program 1 times [2025-02-08 05:38:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-02-08 05:38:12,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:12,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:38:12,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:38:12,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:12,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:12,828 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:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:12,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-02-08 05:38:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856120832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:12,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:12,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751486526] [2025-02-08 05:38:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:12,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:12,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:12,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:12,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1011 transitions, 2048 flow. Second operand has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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:12,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:12,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:12,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:13,448 INFO L124 PetriNetUnfolderBase]: 157/2817 cut-off events. [2025-02-08 05:38:13,449 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-02-08 05:38:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 2817 events. 157/2817 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20011 event pairs, 26 based on Foata normal form. 0/2288 useless extension candidates. Maximal degree in co-relation 2261. Up to 106 conditions per place. [2025-02-08 05:38:13,527 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 22 selfloop transitions, 2 changer transitions 0/1012 dead transitions. [2025-02-08 05:38:13,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1012 transitions, 2100 flow [2025-02-08 05:38:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3169 transitions. [2025-02-08 05:38:13,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691131498470948 [2025-02-08 05:38:13,530 INFO L175 Difference]: Start difference. First operand has 982 places, 1011 transitions, 2048 flow. Second operand 3 states and 3169 transitions. [2025-02-08 05:38:13,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1012 transitions, 2100 flow [2025-02-08 05:38:13,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1012 transitions, 2100 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:13,539 INFO L231 Difference]: Finished difference. Result has 983 places, 1010 transitions, 2050 flow [2025-02-08 05:38:13,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2050, PETRI_PLACES=983, PETRI_TRANSITIONS=1010} [2025-02-08 05:38:13,540 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -41 predicate places. [2025-02-08 05:38:13,540 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 1010 transitions, 2050 flow [2025-02-08 05:38:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:13,541 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] [2025-02-08 05:38:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:13,541 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:13,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1339444628, now seen corresponding path program 1 times [2025-02-08 05:38:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589202971] [2025-02-08 05:38:13,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:13,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 05:38:13,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 05:38:13,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:13,581 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:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589202971] [2025-02-08 05:38:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589202971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992277100] [2025-02-08 05:38:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:13,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:13,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1090 [2025-02-08 05:38:13,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1010 transitions, 2050 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:13,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1090 [2025-02-08 05:38:13,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:14,119 INFO L124 PetriNetUnfolderBase]: 99/2041 cut-off events. [2025-02-08 05:38:14,119 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2025-02-08 05:38:14,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 2041 events. 99/2041 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11523 event pairs, 4 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 1895. Up to 48 conditions per place. [2025-02-08 05:38:14,199 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 16 selfloop transitions, 2 changer transitions 0/1011 dead transitions. [2025-02-08 05:38:14,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1011 transitions, 2090 flow [2025-02-08 05:38:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3181 transitions. [2025-02-08 05:38:14,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972782874617737 [2025-02-08 05:38:14,205 INFO L175 Difference]: Start difference. First operand has 983 places, 1010 transitions, 2050 flow. Second operand 3 states and 3181 transitions. [2025-02-08 05:38:14,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1011 transitions, 2090 flow [2025-02-08 05:38:14,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1011 transitions, 2086 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:14,218 INFO L231 Difference]: Finished difference. Result has 982 places, 1009 transitions, 2048 flow [2025-02-08 05:38:14,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2048, PETRI_PLACES=982, PETRI_TRANSITIONS=1009} [2025-02-08 05:38:14,220 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -42 predicate places. [2025-02-08 05:38:14,220 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1009 transitions, 2048 flow [2025-02-08 05:38:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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:14,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,221 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:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:14,221 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:14,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -535256439, now seen corresponding path program 1 times [2025-02-08 05:38:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457730307] [2025-02-08 05:38:14,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:38:14,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:38:14,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,262 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:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457730307] [2025-02-08 05:38:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457730307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162308584] [2025-02-08 05:38:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1045 out of 1090 [2025-02-08 05:38:14,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1009 transitions, 2048 flow. Second operand has 3 states, 3 states have (on average 1046.3333333333333) internal successors, (3139), 3 states have internal predecessors, (3139), 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:14,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1045 of 1090 [2025-02-08 05:38:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,361 INFO L124 PetriNetUnfolderBase]: 177/3699 cut-off events. [2025-02-08 05:38:15,361 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 3699 events. 177/3699 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 25112 event pairs, 8 based on Foata normal form. 0/3010 useless extension candidates. Maximal degree in co-relation 3366. Up to 42 conditions per place. [2025-02-08 05:38:15,516 INFO L140 encePairwiseOnDemand]: 1076/1090 looper letters, 17 selfloop transitions, 9 changer transitions 0/1009 dead transitions. [2025-02-08 05:38:15,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1009 transitions, 2102 flow [2025-02-08 05:38:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:38:15,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681957186544342 [2025-02-08 05:38:15,519 INFO L175 Difference]: Start difference. First operand has 982 places, 1009 transitions, 2048 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:38:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1009 transitions, 2102 flow [2025-02-08 05:38:15,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 1009 transitions, 2098 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,531 INFO L231 Difference]: Finished difference. Result has 978 places, 1007 transitions, 2073 flow [2025-02-08 05:38:15,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2073, PETRI_PLACES=978, PETRI_TRANSITIONS=1007} [2025-02-08 05:38:15,532 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -46 predicate places. [2025-02-08 05:38:15,532 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1007 transitions, 2073 flow [2025-02-08 05:38:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1046.3333333333333) internal successors, (3139), 3 states have internal predecessors, (3139), 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,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:15,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:15,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1176174213, now seen corresponding path program 1 times [2025-02-08 05:38:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533362871] [2025-02-08 05:38:15,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:15,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:15,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,576 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:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533362871] [2025-02-08 05:38:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533362871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981923982] [2025-02-08 05:38:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1090 [2025-02-08 05:38:15,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1007 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 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,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1090 [2025-02-08 05:38:15,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,238 INFO L124 PetriNetUnfolderBase]: 1489/19588 cut-off events. [2025-02-08 05:38:19,238 INFO L125 PetriNetUnfolderBase]: For 145/151 co-relation queries the response was YES. [2025-02-08 05:38:19,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20823 conditions, 19588 events. 1489/19588 cut-off events. For 145/151 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 218530 event pairs, 370 based on Foata normal form. 0/15741 useless extension candidates. Maximal degree in co-relation 15922. Up to 1173 conditions per place. [2025-02-08 05:38:19,598 INFO L140 encePairwiseOnDemand]: 1078/1090 looper letters, 29 selfloop transitions, 2 changer transitions 0/1001 dead transitions. [2025-02-08 05:38:19,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 1001 transitions, 2125 flow [2025-02-08 05:38:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3143 transitions. [2025-02-08 05:38:19,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611620795107033 [2025-02-08 05:38:19,600 INFO L175 Difference]: Start difference. First operand has 978 places, 1007 transitions, 2073 flow. Second operand 3 states and 3143 transitions. [2025-02-08 05:38:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 1001 transitions, 2125 flow [2025-02-08 05:38:19,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 1001 transitions, 2116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:19,608 INFO L231 Difference]: Finished difference. Result has 970 places, 999 transitions, 2058 flow [2025-02-08 05:38:19,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=970, PETRI_TRANSITIONS=999} [2025-02-08 05:38:19,609 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -54 predicate places. [2025-02-08 05:38:19,609 INFO L471 AbstractCegarLoop]: Abstraction has has 970 places, 999 transitions, 2058 flow [2025-02-08 05:38:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 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:19,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,609 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] [2025-02-08 05:38:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:19,609 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1361586085, now seen corresponding path program 1 times [2025-02-08 05:38:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-02-08 05:38:19,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:19,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:19,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,636 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:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-02-08 05:38:19,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492065772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343142650] [2025-02-08 05:38:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1090 [2025-02-08 05:38:19,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 999 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 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:19,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1090 [2025-02-08 05:38:19,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,411 INFO L124 PetriNetUnfolderBase]: 243/4998 cut-off events. [2025-02-08 05:38:20,411 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2025-02-08 05:38:20,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5192 conditions, 4998 events. 243/4998 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 43261 event pairs, 20 based on Foata normal form. 1/4108 useless extension candidates. Maximal degree in co-relation 4476. Up to 65 conditions per place. [2025-02-08 05:38:20,573 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 21 selfloop transitions, 3 changer transitions 0/1000 dead transitions. [2025-02-08 05:38:20,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1000 transitions, 2110 flow [2025-02-08 05:38:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3175 transitions. [2025-02-08 05:38:20,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709480122324159 [2025-02-08 05:38:20,576 INFO L175 Difference]: Start difference. First operand has 970 places, 999 transitions, 2058 flow. Second operand 3 states and 3175 transitions. [2025-02-08 05:38:20,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 1000 transitions, 2110 flow [2025-02-08 05:38:20,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 1000 transitions, 2110 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:20,584 INFO L231 Difference]: Finished difference. Result has 971 places, 998 transitions, 2062 flow [2025-02-08 05:38:20,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2062, PETRI_PLACES=971, PETRI_TRANSITIONS=998} [2025-02-08 05:38:20,585 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -53 predicate places. [2025-02-08 05:38:20,585 INFO L471 AbstractCegarLoop]: Abstraction has has 971 places, 998 transitions, 2062 flow [2025-02-08 05:38:20,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 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,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,586 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] [2025-02-08 05:38:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:20,586 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 568487878, now seen corresponding path program 1 times [2025-02-08 05:38:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245034340] [2025-02-08 05:38:20,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:38:20,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:38:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,622 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:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245034340] [2025-02-08 05:38:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245034340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517784446] [2025-02-08 05:38:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:20,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 998 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:20,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:21,118 INFO L124 PetriNetUnfolderBase]: 159/2763 cut-off events. [2025-02-08 05:38:21,119 INFO L125 PetriNetUnfolderBase]: For 44/56 co-relation queries the response was YES. [2025-02-08 05:38:21,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2763 events. 159/2763 cut-off events. For 44/56 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 20374 event pairs, 15 based on Foata normal form. 1/2288 useless extension candidates. Maximal degree in co-relation 2228. Up to 139 conditions per place. [2025-02-08 05:38:21,207 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 22 selfloop transitions, 2 changer transitions 0/999 dead transitions. [2025-02-08 05:38:21,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 999 transitions, 2114 flow [2025-02-08 05:38:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3169 transitions. [2025-02-08 05:38:21,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9691131498470948 [2025-02-08 05:38:21,209 INFO L175 Difference]: Start difference. First operand has 971 places, 998 transitions, 2062 flow. Second operand 3 states and 3169 transitions. [2025-02-08 05:38:21,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 999 transitions, 2114 flow [2025-02-08 05:38:21,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 999 transitions, 2108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:21,218 INFO L231 Difference]: Finished difference. Result has 970 places, 997 transitions, 2058 flow [2025-02-08 05:38:21,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=970, PETRI_TRANSITIONS=997} [2025-02-08 05:38:21,219 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -54 predicate places. [2025-02-08 05:38:21,219 INFO L471 AbstractCegarLoop]: Abstraction has has 970 places, 997 transitions, 2058 flow [2025-02-08 05:38:21,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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:21,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:21,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:21,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:21,219 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:21,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1060341827, now seen corresponding path program 1 times [2025-02-08 05:38:21,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315204266] [2025-02-08 05:38:21,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:21,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 05:38:21,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 05:38:21,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:21,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:21,246 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:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315204266] [2025-02-08 05:38:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315204266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140184021] [2025-02-08 05:38:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:21,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:21,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:21,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1045 out of 1090 [2025-02-08 05:38:21,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 997 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 1046.6666666666667) internal successors, (3140), 3 states have internal predecessors, (3140), 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:21,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:21,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1045 of 1090 [2025-02-08 05:38:21,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:22,088 INFO L124 PetriNetUnfolderBase]: 275/5389 cut-off events. [2025-02-08 05:38:22,088 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-02-08 05:38:22,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5631 conditions, 5389 events. 275/5389 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 43863 event pairs, 15 based on Foata normal form. 0/4441 useless extension candidates. Maximal degree in co-relation 5276. Up to 66 conditions per place. [2025-02-08 05:38:22,217 INFO L140 encePairwiseOnDemand]: 1076/1090 looper letters, 17 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-02-08 05:38:22,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 997 transitions, 2112 flow [2025-02-08 05:38:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3166 transitions. [2025-02-08 05:38:22,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681957186544342 [2025-02-08 05:38:22,219 INFO L175 Difference]: Start difference. First operand has 970 places, 997 transitions, 2058 flow. Second operand 3 states and 3166 transitions. [2025-02-08 05:38:22,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 967 places, 997 transitions, 2112 flow [2025-02-08 05:38:22,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 997 transitions, 2108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:22,227 INFO L231 Difference]: Finished difference. Result has 966 places, 995 transitions, 2083 flow [2025-02-08 05:38:22,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=963, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=992, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2083, PETRI_PLACES=966, PETRI_TRANSITIONS=995} [2025-02-08 05:38:22,229 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -58 predicate places. [2025-02-08 05:38:22,229 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 995 transitions, 2083 flow [2025-02-08 05:38:22,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1046.6666666666667) internal successors, (3140), 3 states have internal predecessors, (3140), 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:22,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:22,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:38:22,230 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 813954305, now seen corresponding path program 1 times [2025-02-08 05:38:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-02-08 05:38:22,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:22,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 05:38:22,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 05:38:22,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:22,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:22,256 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:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-02-08 05:38:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258349871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138136728] [2025-02-08 05:38:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:22,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:22,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:22,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1090 [2025-02-08 05:38:22,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 995 transitions, 2083 flow. Second operand has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 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:22,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:22,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1090 [2025-02-08 05:38:22,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:23,187 INFO L124 PetriNetUnfolderBase]: 265/5251 cut-off events. [2025-02-08 05:38:23,188 INFO L125 PetriNetUnfolderBase]: For 108/161 co-relation queries the response was YES. [2025-02-08 05:38:23,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5543 conditions, 5251 events. 265/5251 cut-off events. For 108/161 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 46371 event pairs, 30 based on Foata normal form. 0/4331 useless extension candidates. Maximal degree in co-relation 4969. Up to 99 conditions per place. [2025-02-08 05:38:23,358 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 21 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-02-08 05:38:23,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 996 transitions, 2135 flow [2025-02-08 05:38:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3175 transitions. [2025-02-08 05:38:23,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9709480122324159 [2025-02-08 05:38:23,360 INFO L175 Difference]: Start difference. First operand has 966 places, 995 transitions, 2083 flow. Second operand 3 states and 3175 transitions. [2025-02-08 05:38:23,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 967 places, 996 transitions, 2135 flow [2025-02-08 05:38:23,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 996 transitions, 2126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:23,381 INFO L231 Difference]: Finished difference. Result has 966 places, 994 transitions, 2078 flow [2025-02-08 05:38:23,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=964, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=966, PETRI_TRANSITIONS=994} [2025-02-08 05:38:23,386 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -58 predicate places. [2025-02-08 05:38:23,386 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 994 transitions, 2078 flow [2025-02-08 05:38:23,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 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,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,387 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] [2025-02-08 05:38:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:38:23,387 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:23,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -145905554, now seen corresponding path program 1 times [2025-02-08 05:38:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375447852] [2025-02-08 05:38:23,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:38:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:38:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,433 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:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375447852] [2025-02-08 05:38:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375447852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061248701] [2025-02-08 05:38:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:23,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:23,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1045 out of 1090 [2025-02-08 05:38:23,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 994 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1047.0) internal successors, (3141), 3 states have internal predecessors, (3141), 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,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:23,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1045 of 1090 [2025-02-08 05:38:23,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:23,943 INFO L124 PetriNetUnfolderBase]: 163/2993 cut-off events. [2025-02-08 05:38:23,943 INFO L125 PetriNetUnfolderBase]: For 38/45 co-relation queries the response was YES. [2025-02-08 05:38:24,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 2993 events. 163/2993 cut-off events. For 38/45 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 21244 event pairs, 21 based on Foata normal form. 3/2519 useless extension candidates. Maximal degree in co-relation 2478. Up to 90 conditions per place. [2025-02-08 05:38:24,032 INFO L140 encePairwiseOnDemand]: 1076/1090 looper letters, 15 selfloop transitions, 8 changer transitions 12/994 dead transitions. [2025-02-08 05:38:24,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 994 transitions, 2130 flow [2025-02-08 05:38:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3165 transitions. [2025-02-08 05:38:24,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9678899082568807 [2025-02-08 05:38:24,034 INFO L175 Difference]: Start difference. First operand has 966 places, 994 transitions, 2078 flow. Second operand 3 states and 3165 transitions. [2025-02-08 05:38:24,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 994 transitions, 2130 flow [2025-02-08 05:38:24,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 994 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:24,042 INFO L231 Difference]: Finished difference. Result has 962 places, 980 transitions, 2069 flow [2025-02-08 05:38:24,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2069, PETRI_PLACES=962, PETRI_TRANSITIONS=980} [2025-02-08 05:38:24,043 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -62 predicate places. [2025-02-08 05:38:24,043 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 980 transitions, 2069 flow [2025-02-08 05:38:24,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1047.0) internal successors, (3141), 3 states have internal predecessors, (3141), 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:24,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:24,043 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] [2025-02-08 05:38:24,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:38:24,044 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:24,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 937304628, now seen corresponding path program 1 times [2025-02-08 05:38:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:24,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-02-08 05:38:24,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:24,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:38:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:38:24,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:24,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:24,081 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:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-02-08 05:38:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005345427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:24,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:24,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359734749] [2025-02-08 05:38:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:24,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:24,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:24,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:24,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1090 [2025-02-08 05:38:24,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 980 transitions, 2069 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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:24,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:24,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1090 [2025-02-08 05:38:24,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:24,975 INFO L124 PetriNetUnfolderBase]: 198/4489 cut-off events. [2025-02-08 05:38:24,976 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2025-02-08 05:38:25,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 4489 events. 198/4489 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 37405 event pairs, 4 based on Foata normal form. 1/3765 useless extension candidates. Maximal degree in co-relation 4405. Up to 64 conditions per place. [2025-02-08 05:38:25,146 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 16 selfloop transitions, 2 changer transitions 0/985 dead transitions. [2025-02-08 05:38:25,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 985 transitions, 2119 flow [2025-02-08 05:38:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3190 transitions. [2025-02-08 05:38:25,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755351681957186 [2025-02-08 05:38:25,148 INFO L175 Difference]: Start difference. First operand has 962 places, 980 transitions, 2069 flow. Second operand 3 states and 3190 transitions. [2025-02-08 05:38:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 985 transitions, 2119 flow [2025-02-08 05:38:25,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 985 transitions, 2111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:25,157 INFO L231 Difference]: Finished difference. Result has 954 places, 981 transitions, 2075 flow [2025-02-08 05:38:25,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=980, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=954, PETRI_TRANSITIONS=981} [2025-02-08 05:38:25,158 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -70 predicate places. [2025-02-08 05:38:25,158 INFO L471 AbstractCegarLoop]: Abstraction has has 954 places, 981 transitions, 2075 flow [2025-02-08 05:38:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:25,159 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] [2025-02-08 05:38:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:38:25,159 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 793691633, now seen corresponding path program 1 times [2025-02-08 05:38:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231442692] [2025-02-08 05:38:25,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:25,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-08 05:38:25,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-08 05:38:25,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:25,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:25,187 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:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231442692] [2025-02-08 05:38:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231442692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114872076] [2025-02-08 05:38:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:25,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:25,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:25,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:25,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1036 out of 1090 [2025-02-08 05:38:25,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 981 transitions, 2075 flow. Second operand has 3 states, 3 states have (on average 1037.6666666666667) internal successors, (3113), 3 states have internal predecessors, (3113), 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,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:25,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1036 of 1090 [2025-02-08 05:38:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:26,989 INFO L124 PetriNetUnfolderBase]: 454/8772 cut-off events. [2025-02-08 05:38:26,990 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2025-02-08 05:38:27,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9525 conditions, 8772 events. 454/8772 cut-off events. For 6/42 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 80265 event pairs, 14 based on Foata normal form. 2/7381 useless extension candidates. Maximal degree in co-relation 7945. Up to 166 conditions per place. [2025-02-08 05:38:27,280 INFO L140 encePairwiseOnDemand]: 1073/1090 looper letters, 23 selfloop transitions, 9 changer transitions 0/979 dead transitions. [2025-02-08 05:38:27,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 979 transitions, 2137 flow [2025-02-08 05:38:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3148 transitions. [2025-02-08 05:38:27,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962691131498471 [2025-02-08 05:38:27,282 INFO L175 Difference]: Start difference. First operand has 954 places, 981 transitions, 2075 flow. Second operand 3 states and 3148 transitions. [2025-02-08 05:38:27,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 979 transitions, 2137 flow [2025-02-08 05:38:27,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 979 transitions, 2135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:27,291 INFO L231 Difference]: Finished difference. Result has 949 places, 977 transitions, 2109 flow [2025-02-08 05:38:27,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2109, PETRI_PLACES=949, PETRI_TRANSITIONS=977} [2025-02-08 05:38:27,292 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -75 predicate places. [2025-02-08 05:38:27,292 INFO L471 AbstractCegarLoop]: Abstraction has has 949 places, 977 transitions, 2109 flow [2025-02-08 05:38:27,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1037.6666666666667) internal successors, (3113), 3 states have internal predecessors, (3113), 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,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:27,293 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:27,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:38:27,293 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -192325184, now seen corresponding path program 1 times [2025-02-08 05:38:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-02-08 05:38:27,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:27,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:27,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:27,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:27,321 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:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-02-08 05:38:27,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599097893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:27,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342634947] [2025-02-08 05:38:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:27,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:27,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:27,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:27,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1090 [2025-02-08 05:38:27,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 977 transitions, 2109 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:27,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1090 [2025-02-08 05:38:27,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:28,230 INFO L124 PetriNetUnfolderBase]: 228/3653 cut-off events. [2025-02-08 05:38:28,230 INFO L125 PetriNetUnfolderBase]: For 189/211 co-relation queries the response was YES. [2025-02-08 05:38:28,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 3653 events. 228/3653 cut-off events. For 189/211 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 29686 event pairs, 36 based on Foata normal form. 1/3067 useless extension candidates. Maximal degree in co-relation 3498. Up to 201 conditions per place. [2025-02-08 05:38:28,386 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 19 selfloop transitions, 3 changer transitions 0/978 dead transitions. [2025-02-08 05:38:28,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 978 transitions, 2157 flow [2025-02-08 05:38:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3173 transitions. [2025-02-08 05:38:28,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703363914373089 [2025-02-08 05:38:28,389 INFO L175 Difference]: Start difference. First operand has 949 places, 977 transitions, 2109 flow. Second operand 3 states and 3173 transitions. [2025-02-08 05:38:28,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 978 transitions, 2157 flow [2025-02-08 05:38:28,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 978 transitions, 2139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:28,397 INFO L231 Difference]: Finished difference. Result has 948 places, 976 transitions, 2095 flow [2025-02-08 05:38:28,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2095, PETRI_PLACES=948, PETRI_TRANSITIONS=976} [2025-02-08 05:38:28,398 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -76 predicate places. [2025-02-08 05:38:28,398 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 976 transitions, 2095 flow [2025-02-08 05:38:28,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 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:28,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:28,399 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:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:38:28,399 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1632391598, now seen corresponding path program 1 times [2025-02-08 05:38:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-02-08 05:38:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:28,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:28,423 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:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-02-08 05:38:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496924754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675739685] [2025-02-08 05:38:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:28,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:28,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:28,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:28,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:28,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 976 transitions, 2095 flow. Second operand has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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:28,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:28,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:28,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:30,054 INFO L124 PetriNetUnfolderBase]: 342/6845 cut-off events. [2025-02-08 05:38:30,054 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2025-02-08 05:38:30,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7533 conditions, 6845 events. 342/6845 cut-off events. For 97/135 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 65646 event pairs, 48 based on Foata normal form. 2/5784 useless extension candidates. Maximal degree in co-relation 6018. Up to 147 conditions per place. [2025-02-08 05:38:30,208 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 24 selfloop transitions, 3 changer transitions 0/977 dead transitions. [2025-02-08 05:38:30,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 977 transitions, 2153 flow [2025-02-08 05:38:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:38:30,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:38:30,210 INFO L175 Difference]: Start difference. First operand has 948 places, 976 transitions, 2095 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:38:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 977 transitions, 2153 flow [2025-02-08 05:38:30,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 977 transitions, 2147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:30,218 INFO L231 Difference]: Finished difference. Result has 947 places, 975 transitions, 2093 flow [2025-02-08 05:38:30,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=947, PETRI_TRANSITIONS=975} [2025-02-08 05:38:30,219 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -77 predicate places. [2025-02-08 05:38:30,219 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 975 transitions, 2093 flow [2025-02-08 05:38:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.0) internal successors, (3150), 3 states have internal predecessors, (3150), 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,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:30,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:38:30,220 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 85005672, now seen corresponding path program 1 times [2025-02-08 05:38:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407033061] [2025-02-08 05:38:30,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:30,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-08 05:38:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-08 05:38:30,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:30,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:30,247 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:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407033061] [2025-02-08 05:38:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407033061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506939879] [2025-02-08 05:38:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:30,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:30,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:30,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:30,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1090 [2025-02-08 05:38:30,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 975 transitions, 2093 flow. Second operand has 3 states, 3 states have (on average 1059.6666666666667) internal successors, (3179), 3 states have internal predecessors, (3179), 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,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:30,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1090 [2025-02-08 05:38:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:31,873 INFO L124 PetriNetUnfolderBase]: 246/5533 cut-off events. [2025-02-08 05:38:31,874 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2025-02-08 05:38:32,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 5533 events. 246/5533 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 48911 event pairs, 8 based on Foata normal form. 0/4647 useless extension candidates. Maximal degree in co-relation 4768. Up to 78 conditions per place. [2025-02-08 05:38:32,179 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 15 selfloop transitions, 2 changer transitions 0/979 dead transitions. [2025-02-08 05:38:32,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 979 transitions, 2138 flow [2025-02-08 05:38:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3189 transitions. [2025-02-08 05:38:32,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9752293577981651 [2025-02-08 05:38:32,181 INFO L175 Difference]: Start difference. First operand has 947 places, 975 transitions, 2093 flow. Second operand 3 states and 3189 transitions. [2025-02-08 05:38:32,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 979 transitions, 2138 flow [2025-02-08 05:38:32,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 979 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:32,190 INFO L231 Difference]: Finished difference. Result has 949 places, 976 transitions, 2101 flow [2025-02-08 05:38:32,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2101, PETRI_PLACES=949, PETRI_TRANSITIONS=976} [2025-02-08 05:38:32,190 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -75 predicate places. [2025-02-08 05:38:32,191 INFO L471 AbstractCegarLoop]: Abstraction has has 949 places, 976 transitions, 2101 flow [2025-02-08 05:38:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.6666666666667) internal successors, (3179), 3 states have internal predecessors, (3179), 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,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:32,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:38:32,191 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2073157157, now seen corresponding path program 1 times [2025-02-08 05:38:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-02-08 05:38:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:32,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 05:38:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 05:38:32,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-02-08 05:38:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449622044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493283108] [2025-02-08 05:38:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:32,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:32,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:32,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1036 out of 1090 [2025-02-08 05:38:32,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 976 transitions, 2101 flow. Second operand has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 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,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:32,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1036 of 1090 [2025-02-08 05:38:32,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:35,470 INFO L124 PetriNetUnfolderBase]: 592/10381 cut-off events. [2025-02-08 05:38:35,470 INFO L125 PetriNetUnfolderBase]: For 84/224 co-relation queries the response was YES. [2025-02-08 05:38:35,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11441 conditions, 10381 events. 592/10381 cut-off events. For 84/224 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 106604 event pairs, 67 based on Foata normal form. 0/8750 useless extension candidates. Maximal degree in co-relation 9401. Up to 336 conditions per place. [2025-02-08 05:38:35,982 INFO L140 encePairwiseOnDemand]: 1073/1090 looper letters, 23 selfloop transitions, 9 changer transitions 0/974 dead transitions. [2025-02-08 05:38:35,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 974 transitions, 2163 flow [2025-02-08 05:38:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3148 transitions. [2025-02-08 05:38:35,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962691131498471 [2025-02-08 05:38:35,984 INFO L175 Difference]: Start difference. First operand has 949 places, 976 transitions, 2101 flow. Second operand 3 states and 3148 transitions. [2025-02-08 05:38:35,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 974 transitions, 2163 flow [2025-02-08 05:38:35,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 974 transitions, 2161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:35,992 INFO L231 Difference]: Finished difference. Result has 944 places, 972 transitions, 2135 flow [2025-02-08 05:38:35,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=944, PETRI_TRANSITIONS=972} [2025-02-08 05:38:35,993 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -80 predicate places. [2025-02-08 05:38:35,993 INFO L471 AbstractCegarLoop]: Abstraction has has 944 places, 972 transitions, 2135 flow [2025-02-08 05:38:35,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 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,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:35,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:35,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:38:35,994 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:35,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1653849846, now seen corresponding path program 1 times [2025-02-08 05:38:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-02-08 05:38:35,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:36,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:38:36,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:38:36,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:36,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:36,020 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:36,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-02-08 05:38:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782163896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015589922] [2025-02-08 05:38:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:36,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:36,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:36,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:36,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 972 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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:36,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:36,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,943 INFO L124 PetriNetUnfolderBase]: 454/8454 cut-off events. [2025-02-08 05:38:38,944 INFO L125 PetriNetUnfolderBase]: For 386/624 co-relation queries the response was YES. [2025-02-08 05:38:39,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 8454 events. 454/8454 cut-off events. For 386/624 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 89192 event pairs, 95 based on Foata normal form. 0/7147 useless extension candidates. Maximal degree in co-relation 7710. Up to 284 conditions per place. [2025-02-08 05:38:39,305 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 24 selfloop transitions, 3 changer transitions 0/973 dead transitions. [2025-02-08 05:38:39,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 973 transitions, 2193 flow [2025-02-08 05:38:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:38:39,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:38:39,307 INFO L175 Difference]: Start difference. First operand has 944 places, 972 transitions, 2135 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:38:39,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 973 transitions, 2193 flow [2025-02-08 05:38:39,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 973 transitions, 2175 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:39,328 INFO L231 Difference]: Finished difference. Result has 943 places, 971 transitions, 2121 flow [2025-02-08 05:38:39,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=943, PETRI_TRANSITIONS=971} [2025-02-08 05:38:39,332 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -81 predicate places. [2025-02-08 05:38:39,333 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 971 transitions, 2121 flow [2025-02-08 05:38:39,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 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,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 05:38:39,333 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2122952168, now seen corresponding path program 1 times [2025-02-08 05:38:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106653639] [2025-02-08 05:38:39,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:38:39,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:38:39,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,360 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:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106653639] [2025-02-08 05:38:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106653639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731771070] [2025-02-08 05:38:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1050 out of 1090 [2025-02-08 05:38:39,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 971 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1051.6666666666667) internal successors, (3155), 3 states have internal predecessors, (3155), 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,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1050 of 1090 [2025-02-08 05:38:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:41,001 INFO L124 PetriNetUnfolderBase]: 246/5105 cut-off events. [2025-02-08 05:38:41,001 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-02-08 05:38:41,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 5105 events. 246/5105 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 46765 event pairs, 6 based on Foata normal form. 2/4412 useless extension candidates. Maximal degree in co-relation 4458. Up to 106 conditions per place. [2025-02-08 05:38:41,336 INFO L140 encePairwiseOnDemand]: 1083/1090 looper letters, 15 selfloop transitions, 3 changer transitions 0/969 dead transitions. [2025-02-08 05:38:41,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 969 transitions, 2155 flow [2025-02-08 05:38:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3172 transitions. [2025-02-08 05:38:41,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9700305810397554 [2025-02-08 05:38:41,339 INFO L175 Difference]: Start difference. First operand has 943 places, 971 transitions, 2121 flow. Second operand 3 states and 3172 transitions. [2025-02-08 05:38:41,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 969 transitions, 2155 flow [2025-02-08 05:38:41,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 969 transitions, 2149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:41,349 INFO L231 Difference]: Finished difference. Result has 939 places, 967 transitions, 2113 flow [2025-02-08 05:38:41,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2113, PETRI_PLACES=939, PETRI_TRANSITIONS=967} [2025-02-08 05:38:41,351 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -85 predicate places. [2025-02-08 05:38:41,351 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 967 transitions, 2113 flow [2025-02-08 05:38:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1051.6666666666667) internal successors, (3155), 3 states have internal predecessors, (3155), 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:41,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:41,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 05:38:41,352 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -438628199, now seen corresponding path program 1 times [2025-02-08 05:38:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-02-08 05:38:41,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-08 05:38:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-08 05:38:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:41,383 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:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-02-08 05:38:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419953978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:41,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:38:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868967641] [2025-02-08 05:38:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:41,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:41,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:41,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1090 [2025-02-08 05:38:41,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 967 transitions, 2113 flow. Second operand has 3 states, 3 states have (on average 1060.0) internal successors, (3180), 3 states have internal predecessors, (3180), 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:41,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:41,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1090 [2025-02-08 05:38:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:43,817 INFO L124 PetriNetUnfolderBase]: 354/8193 cut-off events. [2025-02-08 05:38:43,817 INFO L125 PetriNetUnfolderBase]: For 38/70 co-relation queries the response was YES. [2025-02-08 05:38:44,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 8193 events. 354/8193 cut-off events. For 38/70 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 74633 event pairs, 16 based on Foata normal form. 2/6870 useless extension candidates. Maximal degree in co-relation 7526. Up to 157 conditions per place. [2025-02-08 05:38:44,159 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 14 selfloop transitions, 2 changer transitions 0/970 dead transitions. [2025-02-08 05:38:44,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 970 transitions, 2153 flow [2025-02-08 05:38:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-02-08 05:38:44,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9749235474006116 [2025-02-08 05:38:44,161 INFO L175 Difference]: Start difference. First operand has 939 places, 967 transitions, 2113 flow. Second operand 3 states and 3188 transitions. [2025-02-08 05:38:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 970 transitions, 2153 flow [2025-02-08 05:38:44,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 970 transitions, 2147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:44,169 INFO L231 Difference]: Finished difference. Result has 941 places, 968 transitions, 2121 flow [2025-02-08 05:38:44,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=965, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=941, PETRI_TRANSITIONS=968} [2025-02-08 05:38:44,173 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -83 predicate places. [2025-02-08 05:38:44,174 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 968 transitions, 2121 flow [2025-02-08 05:38:44,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1060.0) internal successors, (3180), 3 states have internal predecessors, (3180), 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,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:44,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 05:38:44,174 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1372189462, now seen corresponding path program 1 times [2025-02-08 05:38:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47027393] [2025-02-08 05:38:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 05:38:44,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 05:38:44,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,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:38:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47027393] [2025-02-08 05:38:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47027393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029014885] [2025-02-08 05:38:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1036 out of 1090 [2025-02-08 05:38:44,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 968 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1038.3333333333333) internal successors, (3115), 3 states have internal predecessors, (3115), 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,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1036 of 1090 [2025-02-08 05:38:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,910 INFO L124 PetriNetUnfolderBase]: 642/9464 cut-off events. [2025-02-08 05:38:47,911 INFO L125 PetriNetUnfolderBase]: For 302/363 co-relation queries the response was YES. [2025-02-08 05:38:48,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10927 conditions, 9464 events. 642/9464 cut-off events. For 302/363 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 105638 event pairs, 166 based on Foata normal form. 2/8070 useless extension candidates. Maximal degree in co-relation 9347. Up to 682 conditions per place. [2025-02-08 05:38:48,271 INFO L140 encePairwiseOnDemand]: 1073/1090 looper letters, 23 selfloop transitions, 9 changer transitions 0/966 dead transitions. [2025-02-08 05:38:48,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 966 transitions, 2183 flow [2025-02-08 05:38:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3148 transitions. [2025-02-08 05:38:48,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962691131498471 [2025-02-08 05:38:48,273 INFO L175 Difference]: Start difference. First operand has 941 places, 968 transitions, 2121 flow. Second operand 3 states and 3148 transitions. [2025-02-08 05:38:48,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 966 transitions, 2183 flow [2025-02-08 05:38:48,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 966 transitions, 2181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:48,281 INFO L231 Difference]: Finished difference. Result has 936 places, 964 transitions, 2155 flow [2025-02-08 05:38:48,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=936, PETRI_TRANSITIONS=964} [2025-02-08 05:38:48,283 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -88 predicate places. [2025-02-08 05:38:48,283 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 964 transitions, 2155 flow [2025-02-08 05:38:48,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1038.3333333333333) internal successors, (3115), 3 states have internal predecessors, (3115), 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,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:48,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 05:38:48,284 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:48,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1909011639, now seen corresponding path program 1 times [2025-02-08 05:38:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-02-08 05:38:48,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:38:48,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:38:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,310 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:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-02-08 05:38:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760485467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997744] [2025-02-08 05:38:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1048 out of 1090 [2025-02-08 05:38:48,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 964 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 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,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1048 of 1090 [2025-02-08 05:38:48,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,226 INFO L124 PetriNetUnfolderBase]: 534/7934 cut-off events. [2025-02-08 05:38:51,226 INFO L125 PetriNetUnfolderBase]: For 896/965 co-relation queries the response was YES. [2025-02-08 05:38:51,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 7934 events. 534/7934 cut-off events. For 896/965 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 86720 event pairs, 118 based on Foata normal form. 2/6798 useless extension candidates. Maximal degree in co-relation 8011. Up to 585 conditions per place. [2025-02-08 05:38:51,794 INFO L140 encePairwiseOnDemand]: 1087/1090 looper letters, 24 selfloop transitions, 3 changer transitions 0/965 dead transitions. [2025-02-08 05:38:51,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 965 transitions, 2213 flow [2025-02-08 05:38:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3168 transitions. [2025-02-08 05:38:51,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688073394495413 [2025-02-08 05:38:51,795 INFO L175 Difference]: Start difference. First operand has 936 places, 964 transitions, 2155 flow. Second operand 3 states and 3168 transitions. [2025-02-08 05:38:51,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 965 transitions, 2213 flow [2025-02-08 05:38:51,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 965 transitions, 2195 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:51,806 INFO L231 Difference]: Finished difference. Result has 935 places, 963 transitions, 2141 flow [2025-02-08 05:38:51,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2141, PETRI_PLACES=935, PETRI_TRANSITIONS=963} [2025-02-08 05:38:51,807 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -89 predicate places. [2025-02-08 05:38:51,808 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 963 transitions, 2141 flow [2025-02-08 05:38:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 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:51,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:51,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 05:38:51,808 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash -833805164, now seen corresponding path program 1 times [2025-02-08 05:38:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-02-08 05:38:51,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-08 05:38:51,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-08 05:38:51,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:51,858 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:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-02-08 05:38:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135042885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198577058] [2025-02-08 05:38:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:51,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:51,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:51,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1050 out of 1090 [2025-02-08 05:38:51,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 963 transitions, 2141 flow. Second operand has 3 states, 3 states have (on average 1052.0) internal successors, (3156), 3 states have internal predecessors, (3156), 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:51,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1050 of 1090 [2025-02-08 05:38:51,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,872 INFO L124 PetriNetUnfolderBase]: 422/8652 cut-off events. [2025-02-08 05:38:54,872 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-02-08 05:38:55,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 8652 events. 422/8652 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 89428 event pairs, 11 based on Foata normal form. 1/7508 useless extension candidates. Maximal degree in co-relation 8233. Up to 204 conditions per place. [2025-02-08 05:38:55,457 INFO L140 encePairwiseOnDemand]: 1083/1090 looper letters, 15 selfloop transitions, 3 changer transitions 0/961 dead transitions. [2025-02-08 05:38:55,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 961 transitions, 2175 flow [2025-02-08 05:38:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3172 transitions. [2025-02-08 05:38:55,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9700305810397554 [2025-02-08 05:38:55,460 INFO L175 Difference]: Start difference. First operand has 935 places, 963 transitions, 2141 flow. Second operand 3 states and 3172 transitions. [2025-02-08 05:38:55,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 961 transitions, 2175 flow [2025-02-08 05:38:55,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 961 transitions, 2169 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,470 INFO L231 Difference]: Finished difference. Result has 931 places, 959 transitions, 2133 flow [2025-02-08 05:38:55,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1090, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2133, PETRI_PLACES=931, PETRI_TRANSITIONS=959} [2025-02-08 05:38:55,471 INFO L279 CegarLoopForPetriNet]: 1024 programPoint places, -93 predicate places. [2025-02-08 05:38:55,471 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 959 transitions, 2133 flow [2025-02-08 05:38:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.0) internal successors, (3156), 3 states have internal predecessors, (3156), 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,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 05:38:55,472 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-02-08 05:38:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 86884114, now seen corresponding path program 1 times [2025-02-08 05:38:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-02-08 05:38:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-08 05:38:55,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-08 05:38:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,509 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:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-02-08 05:38:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909899214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67674797] [2025-02-08 05:38:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1090 [2025-02-08 05:38:55,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 959 transitions, 2133 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1090 [2025-02-08 05:38:55,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand