./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1 --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-dev-d790fec [2024-12-02 13:24:39,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:24:39,159 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 13:24:39,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:24:39,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:24:39,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:24:39,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:24:39,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:24:39,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:24:39,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:24:39,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:24:39,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:24:39,193 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:24:39,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:24:39,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:24:39,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:24:39,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:24:39,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:24:39,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:24:39,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:24:39,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:24:39,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:24:39,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:24:39,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:24:39,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:24:39,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:24:39,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:24:39,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:24:39,197 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1 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 [2024-12-02 13:24:39,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:24:39,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:24:39,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:24:39,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:24:39,439 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:24:39,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2024-12-02 13:24:42,066 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/data/d1494200b/b5ad159e7e08476690161157f9a035f8/FLAG77428c733 [2024-12-02 13:24:42,276 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:24:42,276 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2024-12-02 13:24:42,282 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/data/d1494200b/b5ad159e7e08476690161157f9a035f8/FLAG77428c733 [2024-12-02 13:24:42,644 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/data/d1494200b/b5ad159e7e08476690161157f9a035f8 [2024-12-02 13:24:42,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:24:42,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:24:42,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:24:42,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:24:42,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:24:42,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdc2510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42, skipping insertion in model container [2024-12-02 13:24:42,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:24:42,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:24:42,880 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:24:42,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:24:42,940 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:24:42,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42 WrapperNode [2024-12-02 13:24:42,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:24:42,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:24:42,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:24:42,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:24:42,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,987 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 840 [2024-12-02 13:24:42,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:24:42,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:24:42,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:24:42,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:24:42,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:42,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:24:43,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:24:43,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:24:43,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:24:43,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (1/1) ... [2024-12-02 13:24:43,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:24:43,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:24:43,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:24:43,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:24:43,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 13:24:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 13:24:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-02 13:24:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:24:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:24:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 13:24:43,101 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 13:24:43,232 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:24:43,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:24:44,202 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 13:24:44,202 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:24:44,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:24:44,230 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-02 13:24:44,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:24:44 BoogieIcfgContainer [2024-12-02 13:24:44,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:24:44,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:24:44,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:24:44,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:24:44,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:24:42" (1/3) ... [2024-12-02 13:24:44,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49f438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:24:44, skipping insertion in model container [2024-12-02 13:24:44,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:24:42" (2/3) ... [2024-12-02 13:24:44,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49f438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:24:44, skipping insertion in model container [2024-12-02 13:24:44,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:24:44" (3/3) ... [2024-12-02 13:24:44,239 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2024-12-02 13:24:44,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:24:44,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 1049 locations, 1 initial locations, 4 loop locations, and 149 error locations. [2024-12-02 13:24:44,257 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 13:24:44,448 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-02 13:24:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1058 places, 1106 transitions, 2233 flow [2024-12-02 13:24:45,220 INFO L124 PetriNetUnfolderBase]: 58/1103 cut-off events. [2024-12-02 13:24:45,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-12-02 13:24:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1103 events. 58/1103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3809 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2024-12-02 13:24:45,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 1058 places, 1106 transitions, 2233 flow [2024-12-02 13:24:45,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1036 places, 1082 transitions, 2182 flow [2024-12-02 13:24:45,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:24:45,341 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;@2c63f7ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:24:45,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 281 error locations. [2024-12-02 13:24:45,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 13:24:45,350 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-12-02 13:24:45,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 13:24:45,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:45,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:24:45,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:45,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -852344849, now seen corresponding path program 1 times [2024-12-02 13:24:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518459960] [2024-12-02 13:24:45,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:45,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:45,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518459960] [2024-12-02 13:24:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518459960] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:45,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376716584] [2024-12-02 13:24:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:45,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:24:45,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1082 transitions, 2182 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:45,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:45,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:24:45,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:47,526 INFO L124 PetriNetUnfolderBase]: 227/4391 cut-off events. [2024-12-02 13:24:47,526 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2024-12-02 13:24:47,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 4391 events. 227/4391 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 33668 event pairs, 45 based on Foata normal form. 208/3683 useless extension candidates. Maximal degree in co-relation 3736. Up to 110 conditions per place. [2024-12-02 13:24:47,632 INFO L140 encePairwiseOnDemand]: 1085/1106 looper letters, 19 selfloop transitions, 2 changer transitions 2/1063 dead transitions. [2024-12-02 13:24:47,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1063 transitions, 2186 flow [2024-12-02 13:24:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-12-02 13:24:47,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731766124171187 [2024-12-02 13:24:47,657 INFO L175 Difference]: Start difference. First operand has 1036 places, 1082 transitions, 2182 flow. Second operand 3 states and 3229 transitions. [2024-12-02 13:24:47,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1063 transitions, 2186 flow [2024-12-02 13:24:47,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-12-02 13:24:47,686 INFO L231 Difference]: Finished difference. Result has 1031 places, 1061 transitions, 2132 flow [2024-12-02 13:24:47,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1031, PETRI_TRANSITIONS=1061} [2024-12-02 13:24:47,693 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -5 predicate places. [2024-12-02 13:24:47,693 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1061 transitions, 2132 flow [2024-12-02 13:24:47,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:47,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:47,695 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] [2024-12-02 13:24:47,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 13:24:47,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:47,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1971647854, now seen corresponding path program 1 times [2024-12-02 13:24:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767690601] [2024-12-02 13:24:47,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767690601] [2024-12-02 13:24:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767690601] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:47,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792096492] [2024-12-02 13:24:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:47,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:47,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:24:47,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:47,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:47,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:24:47,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:50,883 INFO L124 PetriNetUnfolderBase]: 613/12175 cut-off events. [2024-12-02 13:24:50,883 INFO L125 PetriNetUnfolderBase]: For 6/24 co-relation queries the response was YES. [2024-12-02 13:24:50,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 12175 events. 613/12175 cut-off events. For 6/24 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 120557 event pairs, 95 based on Foata normal form. 0/9562 useless extension candidates. Maximal degree in co-relation 12368. Up to 185 conditions per place. [2024-12-02 13:24:51,008 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 19 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2024-12-02 13:24:51,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1060 transitions, 2172 flow [2024-12-02 13:24:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-12-02 13:24:51,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-12-02 13:24:51,015 INFO L175 Difference]: Start difference. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand 3 states and 3211 transitions. [2024-12-02 13:24:51,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1060 transitions, 2172 flow [2024-12-02 13:24:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1060 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:51,024 INFO L231 Difference]: Finished difference. Result has 1028 places, 1060 transitions, 2130 flow [2024-12-02 13:24:51,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1028, PETRI_TRANSITIONS=1060} [2024-12-02 13:24:51,026 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -8 predicate places. [2024-12-02 13:24:51,026 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1060 transitions, 2130 flow [2024-12-02 13:24:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:51,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:51,027 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] [2024-12-02 13:24:51,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 13:24:51,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:51,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 299511637, now seen corresponding path program 1 times [2024-12-02 13:24:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233474162] [2024-12-02 13:24:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233474162] [2024-12-02 13:24:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233474162] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738261] [2024-12-02 13:24:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:51,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:51,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:51,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:51,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:24:51,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:51,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:51,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:24:51,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:52,292 INFO L124 PetriNetUnfolderBase]: 241/3573 cut-off events. [2024-12-02 13:24:52,292 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2024-12-02 13:24:52,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3772 conditions, 3573 events. 241/3573 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27278 event pairs, 95 based on Foata normal form. 0/2832 useless extension candidates. Maximal degree in co-relation 3723. Up to 185 conditions per place. [2024-12-02 13:24:52,408 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 19 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2024-12-02 13:24:52,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1059 transitions, 2170 flow [2024-12-02 13:24:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-12-02 13:24:52,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-12-02 13:24:52,421 INFO L175 Difference]: Start difference. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand 3 states and 3211 transitions. [2024-12-02 13:24:52,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1059 transitions, 2170 flow [2024-12-02 13:24:52,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1059 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:52,448 INFO L231 Difference]: Finished difference. Result has 1027 places, 1059 transitions, 2128 flow [2024-12-02 13:24:52,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1027, PETRI_TRANSITIONS=1059} [2024-12-02 13:24:52,451 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -9 predicate places. [2024-12-02 13:24:52,452 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1059 transitions, 2128 flow [2024-12-02 13:24:52,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:52,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:52,454 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] [2024-12-02 13:24:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 13:24:52,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:52,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1758782048, now seen corresponding path program 1 times [2024-12-02 13:24:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589007073] [2024-12-02 13:24:52,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589007073] [2024-12-02 13:24:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589007073] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:52,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:52,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596612965] [2024-12-02 13:24:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:52,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:52,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:52,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-12-02 13:24:52,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:52,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:52,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-12-02 13:24:52,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:54,090 INFO L124 PetriNetUnfolderBase]: 246/5498 cut-off events. [2024-12-02 13:24:54,090 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-12-02 13:24:54,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 5498 events. 246/5498 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 43636 event pairs, 16 based on Foata normal form. 0/4346 useless extension candidates. Maximal degree in co-relation 5517. Up to 51 conditions per place. [2024-12-02 13:24:54,263 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2024-12-02 13:24:54,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1058 transitions, 2166 flow [2024-12-02 13:24:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:24:54,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:24:54,271 INFO L175 Difference]: Start difference. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:24:54,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1058 transitions, 2166 flow [2024-12-02 13:24:54,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1058 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:54,288 INFO L231 Difference]: Finished difference. Result has 1026 places, 1058 transitions, 2126 flow [2024-12-02 13:24:54,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1026, PETRI_TRANSITIONS=1058} [2024-12-02 13:24:54,291 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -10 predicate places. [2024-12-02 13:24:54,291 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1058 transitions, 2126 flow [2024-12-02 13:24:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:54,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:54,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] [2024-12-02 13:24:54,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:24:54,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -33011865, now seen corresponding path program 1 times [2024-12-02 13:24:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813720183] [2024-12-02 13:24:54,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813720183] [2024-12-02 13:24:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813720183] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:54,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:54,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737449341] [2024-12-02 13:24:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:54,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:54,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:54,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-12-02 13:24:54,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:54,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:54,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-12-02 13:24:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:54,815 INFO L124 PetriNetUnfolderBase]: 74/1607 cut-off events. [2024-12-02 13:24:54,815 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-02 13:24:54,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1607 events. 74/1607 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8226 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1603. Up to 40 conditions per place. [2024-12-02 13:24:54,855 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2024-12-02 13:24:54,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1057 transitions, 2158 flow [2024-12-02 13:24:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-12-02 13:24:54,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-12-02 13:24:54,858 INFO L175 Difference]: Start difference. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand 3 states and 3219 transitions. [2024-12-02 13:24:54,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1057 transitions, 2158 flow [2024-12-02 13:24:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:54,871 INFO L231 Difference]: Finished difference. Result has 1025 places, 1057 transitions, 2124 flow [2024-12-02 13:24:54,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1025, PETRI_TRANSITIONS=1057} [2024-12-02 13:24:54,874 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -11 predicate places. [2024-12-02 13:24:54,874 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1057 transitions, 2124 flow [2024-12-02 13:24:54,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:54,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:54,877 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] [2024-12-02 13:24:54,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 13:24:54,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1592505450, now seen corresponding path program 1 times [2024-12-02 13:24:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569279442] [2024-12-02 13:24:54,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569279442] [2024-12-02 13:24:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569279442] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250875536] [2024-12-02 13:24:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:54,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:54,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-12-02 13:24:54,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:54,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:54,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-12-02 13:24:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:56,028 INFO L124 PetriNetUnfolderBase]: 168/3831 cut-off events. [2024-12-02 13:24:56,028 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2024-12-02 13:24:56,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 3831 events. 168/3831 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25997 event pairs, 10 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 3812. Up to 35 conditions per place. [2024-12-02 13:24:56,133 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2024-12-02 13:24:56,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1056 transitions, 2154 flow [2024-12-02 13:24:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-12-02 13:24:56,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-12-02 13:24:56,136 INFO L175 Difference]: Start difference. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand 3 states and 3221 transitions. [2024-12-02 13:24:56,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1056 transitions, 2154 flow [2024-12-02 13:24:56,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:56,146 INFO L231 Difference]: Finished difference. Result has 1024 places, 1056 transitions, 2122 flow [2024-12-02 13:24:56,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1024, PETRI_TRANSITIONS=1056} [2024-12-02 13:24:56,147 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -12 predicate places. [2024-12-02 13:24:56,148 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1056 transitions, 2122 flow [2024-12-02 13:24:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:56,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:56,149 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] [2024-12-02 13:24:56,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 13:24:56,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1038484344, now seen corresponding path program 1 times [2024-12-02 13:24:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243454786] [2024-12-02 13:24:56,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243454786] [2024-12-02 13:24:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243454786] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:56,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515379575] [2024-12-02 13:24:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:56,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:56,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-12-02 13:24:56,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:56,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:56,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-12-02 13:24:56,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:58,373 INFO L124 PetriNetUnfolderBase]: 350/7715 cut-off events. [2024-12-02 13:24:58,373 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-12-02 13:24:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 7715 events. 350/7715 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 68248 event pairs, 24 based on Foata normal form. 0/6092 useless extension candidates. Maximal degree in co-relation 7737. Up to 70 conditions per place. [2024-12-02 13:24:58,634 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2024-12-02 13:24:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1055 transitions, 2166 flow [2024-12-02 13:24:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-12-02 13:24:58,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-12-02 13:24:58,638 INFO L175 Difference]: Start difference. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand 3 states and 3207 transitions. [2024-12-02 13:24:58,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1055 transitions, 2166 flow [2024-12-02 13:24:58,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:58,648 INFO L231 Difference]: Finished difference. Result has 1023 places, 1055 transitions, 2120 flow [2024-12-02 13:24:58,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1023, PETRI_TRANSITIONS=1055} [2024-12-02 13:24:58,650 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -13 predicate places. [2024-12-02 13:24:58,650 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1055 transitions, 2120 flow [2024-12-02 13:24:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:58,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:58,652 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] [2024-12-02 13:24:58,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 13:24:58,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1579953325, now seen corresponding path program 1 times [2024-12-02 13:24:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530308549] [2024-12-02 13:24:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530308549] [2024-12-02 13:24:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530308549] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:58,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:58,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150380891] [2024-12-02 13:24:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:58,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:58,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:58,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-12-02 13:24:58,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:58,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:58,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-12-02 13:24:58,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:24:59,588 INFO L124 PetriNetUnfolderBase]: 150/3278 cut-off events. [2024-12-02 13:24:59,588 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2024-12-02 13:24:59,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 3278 events. 150/3278 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21555 event pairs, 16 based on Foata normal form. 0/2607 useless extension candidates. Maximal degree in co-relation 3257. Up to 51 conditions per place. [2024-12-02 13:24:59,690 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2024-12-02 13:24:59,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1054 transitions, 2158 flow [2024-12-02 13:24:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:24:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:24:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:24:59,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:24:59,698 INFO L175 Difference]: Start difference. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:24:59,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1054 transitions, 2158 flow [2024-12-02 13:24:59,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1054 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:24:59,705 INFO L231 Difference]: Finished difference. Result has 1022 places, 1054 transitions, 2118 flow [2024-12-02 13:24:59,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1022, PETRI_TRANSITIONS=1054} [2024-12-02 13:24:59,706 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -14 predicate places. [2024-12-02 13:24:59,706 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1054 transitions, 2118 flow [2024-12-02 13:24:59,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:59,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:24:59,707 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] [2024-12-02 13:24:59,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 13:24:59,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:24:59,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:24:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1213751527, now seen corresponding path program 1 times [2024-12-02 13:24:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:24:59,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4156233] [2024-12-02 13:24:59,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:24:59,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:24:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:24:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:24:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:24:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4156233] [2024-12-02 13:24:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4156233] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:24:59,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:24:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:24:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784552868] [2024-12-02 13:24:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:24:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:24:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:24:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:24:59,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:24:59,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-12-02 13:24:59,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:24:59,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:24:59,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-12-02 13:24:59,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:00,210 INFO L124 PetriNetUnfolderBase]: 74/1603 cut-off events. [2024-12-02 13:25:00,210 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2024-12-02 13:25:00,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1603 events. 74/1603 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7809 event pairs, 12 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1561. Up to 40 conditions per place. [2024-12-02 13:25:00,243 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2024-12-02 13:25:00,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1053 transitions, 2150 flow [2024-12-02 13:25:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-12-02 13:25:00,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-12-02 13:25:00,246 INFO L175 Difference]: Start difference. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand 3 states and 3219 transitions. [2024-12-02 13:25:00,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1053 transitions, 2150 flow [2024-12-02 13:25:00,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:00,252 INFO L231 Difference]: Finished difference. Result has 1021 places, 1053 transitions, 2116 flow [2024-12-02 13:25:00,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1021, PETRI_TRANSITIONS=1053} [2024-12-02 13:25:00,253 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -15 predicate places. [2024-12-02 13:25:00,253 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1053 transitions, 2116 flow [2024-12-02 13:25:00,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:00,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:00,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:00,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 13:25:00,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:00,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1378866128, now seen corresponding path program 1 times [2024-12-02 13:25:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203523279] [2024-12-02 13:25:00,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203523279] [2024-12-02 13:25:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203523279] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442130668] [2024-12-02 13:25:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:00,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:00,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:00,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:00,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-12-02 13:25:00,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:00,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:00,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-12-02 13:25:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:00,986 INFO L124 PetriNetUnfolderBase]: 108/2442 cut-off events. [2024-12-02 13:25:00,986 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-12-02 13:25:01,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 2442 events. 108/2442 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13677 event pairs, 10 based on Foata normal form. 0/1955 useless extension candidates. Maximal degree in co-relation 2386. Up to 35 conditions per place. [2024-12-02 13:25:01,069 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2024-12-02 13:25:01,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1052 transitions, 2146 flow [2024-12-02 13:25:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-12-02 13:25:01,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-12-02 13:25:01,072 INFO L175 Difference]: Start difference. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand 3 states and 3221 transitions. [2024-12-02 13:25:01,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1052 transitions, 2146 flow [2024-12-02 13:25:01,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:01,081 INFO L231 Difference]: Finished difference. Result has 1020 places, 1052 transitions, 2114 flow [2024-12-02 13:25:01,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1020, PETRI_TRANSITIONS=1052} [2024-12-02 13:25:01,083 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -16 predicate places. [2024-12-02 13:25:01,083 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1052 transitions, 2114 flow [2024-12-02 13:25:01,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:01,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:01,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:01,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 13:25:01,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:01,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1733717947, now seen corresponding path program 1 times [2024-12-02 13:25:01,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:01,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955301402] [2024-12-02 13:25:01,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955301402] [2024-12-02 13:25:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955301402] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:01,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:01,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448886835] [2024-12-02 13:25:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:01,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:01,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:01,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-12-02 13:25:01,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:01,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:01,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-12-02 13:25:01,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:02,816 INFO L124 PetriNetUnfolderBase]: 206/4387 cut-off events. [2024-12-02 13:25:02,816 INFO L125 PetriNetUnfolderBase]: For 13/97 co-relation queries the response was YES. [2024-12-02 13:25:02,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 4387 events. 206/4387 cut-off events. For 13/97 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 32365 event pairs, 24 based on Foata normal form. 0/3477 useless extension candidates. Maximal degree in co-relation 4365. Up to 70 conditions per place. [2024-12-02 13:25:02,992 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2024-12-02 13:25:02,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1051 transitions, 2158 flow [2024-12-02 13:25:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-12-02 13:25:02,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-12-02 13:25:02,995 INFO L175 Difference]: Start difference. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand 3 states and 3207 transitions. [2024-12-02 13:25:02,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1051 transitions, 2158 flow [2024-12-02 13:25:02,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:03,003 INFO L231 Difference]: Finished difference. Result has 1019 places, 1051 transitions, 2112 flow [2024-12-02 13:25:03,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1019, PETRI_TRANSITIONS=1051} [2024-12-02 13:25:03,005 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -17 predicate places. [2024-12-02 13:25:03,005 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1051 transitions, 2112 flow [2024-12-02 13:25:03,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:03,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:03,006 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] [2024-12-02 13:25:03,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 13:25:03,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:03,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 79031581, now seen corresponding path program 1 times [2024-12-02 13:25:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:03,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794828437] [2024-12-02 13:25:03,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:03,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794828437] [2024-12-02 13:25:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794828437] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:03,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:03,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807992411] [2024-12-02 13:25:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:03,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:03,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:03,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:03,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-12-02 13:25:03,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:03,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:03,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-12-02 13:25:03,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:03,518 INFO L124 PetriNetUnfolderBase]: 78/1568 cut-off events. [2024-12-02 13:25:03,518 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-12-02 13:25:03,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1568 events. 78/1568 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7439 event pairs, 16 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1509. Up to 53 conditions per place. [2024-12-02 13:25:03,553 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2024-12-02 13:25:03,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1050 transitions, 2150 flow [2024-12-02 13:25:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:25:03,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:25:03,556 INFO L175 Difference]: Start difference. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:25:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1050 transitions, 2150 flow [2024-12-02 13:25:03,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1050 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:03,566 INFO L231 Difference]: Finished difference. Result has 1018 places, 1050 transitions, 2110 flow [2024-12-02 13:25:03,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1018, PETRI_TRANSITIONS=1050} [2024-12-02 13:25:03,567 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -18 predicate places. [2024-12-02 13:25:03,567 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1050 transitions, 2110 flow [2024-12-02 13:25:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:03,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:03,568 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] [2024-12-02 13:25:03,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 13:25:03,568 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:03,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -243779921, now seen corresponding path program 1 times [2024-12-02 13:25:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113117594] [2024-12-02 13:25:03,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113117594] [2024-12-02 13:25:03,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113117594] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:03,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425320667] [2024-12-02 13:25:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:03,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:03,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:03,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-12-02 13:25:03,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:03,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:03,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-12-02 13:25:03,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:04,143 INFO L124 PetriNetUnfolderBase]: 74/1599 cut-off events. [2024-12-02 13:25:04,143 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-12-02 13:25:04,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1599 events. 74/1599 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7319 event pairs, 12 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 1519. Up to 40 conditions per place. [2024-12-02 13:25:04,171 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2024-12-02 13:25:04,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1049 transitions, 2142 flow [2024-12-02 13:25:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-12-02 13:25:04,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-12-02 13:25:04,174 INFO L175 Difference]: Start difference. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand 3 states and 3219 transitions. [2024-12-02 13:25:04,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1049 transitions, 2142 flow [2024-12-02 13:25:04,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1049 transitions, 2138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:04,183 INFO L231 Difference]: Finished difference. Result has 1017 places, 1049 transitions, 2108 flow [2024-12-02 13:25:04,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1017, PETRI_TRANSITIONS=1049} [2024-12-02 13:25:04,184 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -19 predicate places. [2024-12-02 13:25:04,184 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1049 transitions, 2108 flow [2024-12-02 13:25:04,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:04,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:04,185 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] [2024-12-02 13:25:04,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 13:25:04,185 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:04,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash -672037593, now seen corresponding path program 1 times [2024-12-02 13:25:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650758877] [2024-12-02 13:25:04,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650758877] [2024-12-02 13:25:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650758877] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688065466] [2024-12-02 13:25:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:04,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:04,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:04,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-12-02 13:25:04,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:04,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:04,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-12-02 13:25:04,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:04,561 INFO L124 PetriNetUnfolderBase]: 48/1068 cut-off events. [2024-12-02 13:25:04,561 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-12-02 13:25:04,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1068 events. 48/1068 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4395 event pairs, 10 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 975. Up to 35 conditions per place. [2024-12-02 13:25:04,588 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2024-12-02 13:25:04,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1048 transitions, 2138 flow [2024-12-02 13:25:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-12-02 13:25:04,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-12-02 13:25:04,593 INFO L175 Difference]: Start difference. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand 3 states and 3221 transitions. [2024-12-02 13:25:04,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1048 transitions, 2138 flow [2024-12-02 13:25:04,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1048 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:04,609 INFO L231 Difference]: Finished difference. Result has 1016 places, 1048 transitions, 2106 flow [2024-12-02 13:25:04,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1014, 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=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1048} [2024-12-02 13:25:04,611 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2024-12-02 13:25:04,611 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1048 transitions, 2106 flow [2024-12-02 13:25:04,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:04,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:04,612 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] [2024-12-02 13:25:04,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 13:25:04,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1066854780, now seen corresponding path program 1 times [2024-12-02 13:25:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096222571] [2024-12-02 13:25:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:04,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096222571] [2024-12-02 13:25:04,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096222571] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:04,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:04,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746076914] [2024-12-02 13:25:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:04,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-12-02 13:25:04,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:04,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:04,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-12-02 13:25:04,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:05,098 INFO L124 PetriNetUnfolderBase]: 86/1597 cut-off events. [2024-12-02 13:25:05,098 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-12-02 13:25:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1597 events. 86/1597 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8306 event pairs, 24 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1531. Up to 70 conditions per place. [2024-12-02 13:25:05,134 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2024-12-02 13:25:05,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1047 transitions, 2150 flow [2024-12-02 13:25:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-12-02 13:25:05,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-12-02 13:25:05,138 INFO L175 Difference]: Start difference. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand 3 states and 3207 transitions. [2024-12-02 13:25:05,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1047 transitions, 2150 flow [2024-12-02 13:25:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1047 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:05,148 INFO L231 Difference]: Finished difference. Result has 1015 places, 1047 transitions, 2104 flow [2024-12-02 13:25:05,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1015, PETRI_TRANSITIONS=1047} [2024-12-02 13:25:05,150 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -21 predicate places. [2024-12-02 13:25:05,150 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1047 transitions, 2104 flow [2024-12-02 13:25:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:05,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:05,151 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] [2024-12-02 13:25:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 13:25:05,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -872497634, now seen corresponding path program 1 times [2024-12-02 13:25:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64037947] [2024-12-02 13:25:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:05,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64037947] [2024-12-02 13:25:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64037947] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:05,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:05,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:25:05,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353595482] [2024-12-02 13:25:05,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:05,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:25:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:05,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:25:05,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:25:06,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1106 [2024-12-02 13:25:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:06,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1106 [2024-12-02 13:25:06,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:09,212 INFO L124 PetriNetUnfolderBase]: 894/12787 cut-off events. [2024-12-02 13:25:09,213 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2024-12-02 13:25:09,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13407 conditions, 12787 events. 894/12787 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 132082 event pairs, 264 based on Foata normal form. 0/10058 useless extension candidates. Maximal degree in co-relation 13255. Up to 580 conditions per place. [2024-12-02 13:25:09,379 INFO L140 encePairwiseOnDemand]: 1100/1106 looper letters, 26 selfloop transitions, 5 changer transitions 0/1046 dead transitions. [2024-12-02 13:25:09,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1046 transitions, 2164 flow [2024-12-02 13:25:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:25:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 13:25:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6356 transitions. [2024-12-02 13:25:09,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578059071729957 [2024-12-02 13:25:09,384 INFO L175 Difference]: Start difference. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand 6 states and 6356 transitions. [2024-12-02 13:25:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1046 transitions, 2164 flow [2024-12-02 13:25:09,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1046 transitions, 2160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:09,391 INFO L231 Difference]: Finished difference. Result has 1017 places, 1046 transitions, 2108 flow [2024-12-02 13:25:09,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2108, PETRI_PLACES=1017, PETRI_TRANSITIONS=1046} [2024-12-02 13:25:09,392 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -19 predicate places. [2024-12-02 13:25:09,392 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1046 transitions, 2108 flow [2024-12-02 13:25:09,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:09,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:09,393 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] [2024-12-02 13:25:09,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 13:25:09,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1035084830, now seen corresponding path program 1 times [2024-12-02 13:25:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766347071] [2024-12-02 13:25:09,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766347071] [2024-12-02 13:25:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766347071] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377533827] [2024-12-02 13:25:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:09,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:09,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:09,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1106 [2024-12-02 13:25:09,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1046 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:09,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:09,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1106 [2024-12-02 13:25:09,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:10,136 INFO L124 PetriNetUnfolderBase]: 122/2606 cut-off events. [2024-12-02 13:25:10,136 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2024-12-02 13:25:10,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 2606 events. 122/2606 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14429 event pairs, 15 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 2647. Up to 43 conditions per place. [2024-12-02 13:25:10,192 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 12 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2024-12-02 13:25:10,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1045 transitions, 2134 flow [2024-12-02 13:25:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2024-12-02 13:25:10,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9719710669077758 [2024-12-02 13:25:10,195 INFO L175 Difference]: Start difference. First operand has 1017 places, 1046 transitions, 2108 flow. Second operand 3 states and 3225 transitions. [2024-12-02 13:25:10,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1045 transitions, 2134 flow [2024-12-02 13:25:10,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 1045 transitions, 2124 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 13:25:10,202 INFO L231 Difference]: Finished difference. Result has 1013 places, 1045 transitions, 2100 flow [2024-12-02 13:25:10,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1011, 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=1013, PETRI_TRANSITIONS=1045} [2024-12-02 13:25:10,203 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -23 predicate places. [2024-12-02 13:25:10,203 INFO L471 AbstractCegarLoop]: Abstraction has has 1013 places, 1045 transitions, 2100 flow [2024-12-02 13:25:10,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:10,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:10,204 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] [2024-12-02 13:25:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 13:25:10,204 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 789600261, now seen corresponding path program 1 times [2024-12-02 13:25:10,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:10,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070143004] [2024-12-02 13:25:10,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070143004] [2024-12-02 13:25:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070143004] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774471065] [2024-12-02 13:25:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:10,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-12-02 13:25:10,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1045 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:10,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:10,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-12-02 13:25:10,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:10,702 INFO L124 PetriNetUnfolderBase]: 80/1600 cut-off events. [2024-12-02 13:25:10,702 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-02 13:25:10,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1600 events. 80/1600 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8292 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1478. Up to 43 conditions per place. [2024-12-02 13:25:10,728 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2024-12-02 13:25:10,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 1046 transitions, 2140 flow [2024-12-02 13:25:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-12-02 13:25:10,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-12-02 13:25:10,730 INFO L175 Difference]: Start difference. First operand has 1013 places, 1045 transitions, 2100 flow. Second operand 3 states and 3226 transitions. [2024-12-02 13:25:10,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 1046 transitions, 2140 flow [2024-12-02 13:25:10,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1046 transitions, 2136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:10,738 INFO L231 Difference]: Finished difference. Result has 1012 places, 1044 transitions, 2098 flow [2024-12-02 13:25:10,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1010, 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=1012, PETRI_TRANSITIONS=1044} [2024-12-02 13:25:10,739 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -24 predicate places. [2024-12-02 13:25:10,739 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1044 transitions, 2098 flow [2024-12-02 13:25:10,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:10,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:10,739 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] [2024-12-02 13:25:10,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 13:25:10,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:10,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2068368339, now seen corresponding path program 1 times [2024-12-02 13:25:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561133156] [2024-12-02 13:25:10,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561133156] [2024-12-02 13:25:10,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561133156] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441910381] [2024-12-02 13:25:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:10,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:10,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:10,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:10,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:25:10,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:10,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:10,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:25:10,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:11,450 INFO L124 PetriNetUnfolderBase]: 116/2150 cut-off events. [2024-12-02 13:25:11,450 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-02 13:25:11,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 2150 events. 116/2150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13290 event pairs, 26 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 2058. Up to 73 conditions per place. [2024-12-02 13:25:11,509 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2024-12-02 13:25:11,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1045 transitions, 2150 flow [2024-12-02 13:25:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-12-02 13:25:11,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-12-02 13:25:11,514 INFO L175 Difference]: Start difference. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand 3 states and 3214 transitions. [2024-12-02 13:25:11,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1045 transitions, 2150 flow [2024-12-02 13:25:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1045 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:11,529 INFO L231 Difference]: Finished difference. Result has 1011 places, 1043 transitions, 2096 flow [2024-12-02 13:25:11,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1009, 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=1011, PETRI_TRANSITIONS=1043} [2024-12-02 13:25:11,530 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -25 predicate places. [2024-12-02 13:25:11,531 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1043 transitions, 2096 flow [2024-12-02 13:25:11,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:11,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:11,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:11,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 13:25:11,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -726084335, now seen corresponding path program 1 times [2024-12-02 13:25:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606335722] [2024-12-02 13:25:11,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606335722] [2024-12-02 13:25:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606335722] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866086917] [2024-12-02 13:25:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:11,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:11,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:11,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-12-02 13:25:11,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:11,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:11,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-12-02 13:25:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:12,276 INFO L124 PetriNetUnfolderBase]: 92/1872 cut-off events. [2024-12-02 13:25:12,276 INFO L125 PetriNetUnfolderBase]: For 11/36 co-relation queries the response was YES. [2024-12-02 13:25:12,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1872 events. 92/1872 cut-off events. For 11/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 10242 event pairs, 4 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1724. Up to 43 conditions per place. [2024-12-02 13:25:12,335 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2024-12-02 13:25:12,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1044 transitions, 2136 flow [2024-12-02 13:25:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-12-02 13:25:12,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-12-02 13:25:12,338 INFO L175 Difference]: Start difference. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand 3 states and 3226 transitions. [2024-12-02 13:25:12,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1044 transitions, 2136 flow [2024-12-02 13:25:12,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1044 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:12,346 INFO L231 Difference]: Finished difference. Result has 1010 places, 1042 transitions, 2094 flow [2024-12-02 13:25:12,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1008, 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=1010, PETRI_TRANSITIONS=1042} [2024-12-02 13:25:12,348 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -26 predicate places. [2024-12-02 13:25:12,348 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1042 transitions, 2094 flow [2024-12-02 13:25:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:12,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:12,348 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] [2024-12-02 13:25:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 13:25:12,349 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:12,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1132134966, now seen corresponding path program 1 times [2024-12-02 13:25:12,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:12,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969724020] [2024-12-02 13:25:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969724020] [2024-12-02 13:25:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969724020] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429580640] [2024-12-02 13:25:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:12,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:12,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:12,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-12-02 13:25:12,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1042 transitions, 2094 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) [2024-12-02 13:25:12,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:12,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-12-02 13:25:12,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:14,311 INFO L124 PetriNetUnfolderBase]: 431/5961 cut-off events. [2024-12-02 13:25:14,312 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-12-02 13:25:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 5961 events. 431/5961 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 48804 event pairs, 110 based on Foata normal form. 0/4770 useless extension candidates. Maximal degree in co-relation 5821. Up to 342 conditions per place. [2024-12-02 13:25:14,552 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2024-12-02 13:25:14,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1036 transitions, 2146 flow [2024-12-02 13:25:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-12-02 13:25:14,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-12-02 13:25:14,554 INFO L175 Difference]: Start difference. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand 3 states and 3188 transitions. [2024-12-02 13:25:14,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1036 transitions, 2146 flow [2024-12-02 13:25:14,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1036 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:14,563 INFO L231 Difference]: Finished difference. Result has 1001 places, 1034 transitions, 2084 flow [2024-12-02 13:25:14,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1001, PETRI_TRANSITIONS=1034} [2024-12-02 13:25:14,564 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -35 predicate places. [2024-12-02 13:25:14,565 INFO L471 AbstractCegarLoop]: Abstraction has has 1001 places, 1034 transitions, 2084 flow [2024-12-02 13:25:14,565 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) [2024-12-02 13:25:14,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:14,565 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] [2024-12-02 13:25:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 13:25:14,565 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1354896596, now seen corresponding path program 1 times [2024-12-02 13:25:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032179399] [2024-12-02 13:25:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032179399] [2024-12-02 13:25:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032179399] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:14,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:14,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130868412] [2024-12-02 13:25:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:14,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:14,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:14,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-12-02 13:25:14,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1034 transitions, 2084 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) [2024-12-02 13:25:14,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:14,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-12-02 13:25:14,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:17,793 INFO L124 PetriNetUnfolderBase]: 859/10615 cut-off events. [2024-12-02 13:25:17,793 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-12-02 13:25:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11421 conditions, 10615 events. 859/10615 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 101483 event pairs, 190 based on Foata normal form. 0/8539 useless extension candidates. Maximal degree in co-relation 10945. Up to 660 conditions per place. [2024-12-02 13:25:18,061 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1028 dead transitions. [2024-12-02 13:25:18,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1028 transitions, 2136 flow [2024-12-02 13:25:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-12-02 13:25:18,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-12-02 13:25:18,063 INFO L175 Difference]: Start difference. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand 3 states and 3188 transitions. [2024-12-02 13:25:18,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1028 transitions, 2136 flow [2024-12-02 13:25:18,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1028 transitions, 2136 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 13:25:18,071 INFO L231 Difference]: Finished difference. Result has 994 places, 1026 transitions, 2078 flow [2024-12-02 13:25:18,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1026} [2024-12-02 13:25:18,072 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2024-12-02 13:25:18,072 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1026 transitions, 2078 flow [2024-12-02 13:25:18,073 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) [2024-12-02 13:25:18,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:18,074 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] [2024-12-02 13:25:18,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 13:25:18,074 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:18,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1868422628, now seen corresponding path program 1 times [2024-12-02 13:25:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091305704] [2024-12-02 13:25:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:18,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:18,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091305704] [2024-12-02 13:25:18,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091305704] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:18,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:18,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451571181] [2024-12-02 13:25:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:18,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:18,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:18,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:25:18,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1026 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:18,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:18,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:25:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:18,907 INFO L124 PetriNetUnfolderBase]: 167/2867 cut-off events. [2024-12-02 13:25:18,907 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2024-12-02 13:25:18,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 2867 events. 167/2867 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20450 event pairs, 26 based on Foata normal form. 0/2338 useless extension candidates. Maximal degree in co-relation 2301. Up to 106 conditions per place. [2024-12-02 13:25:18,983 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1027 dead transitions. [2024-12-02 13:25:18,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1027 transitions, 2130 flow [2024-12-02 13:25:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-12-02 13:25:18,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-12-02 13:25:18,985 INFO L175 Difference]: Start difference. First operand has 994 places, 1026 transitions, 2078 flow. Second operand 3 states and 3214 transitions. [2024-12-02 13:25:18,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1027 transitions, 2130 flow [2024-12-02 13:25:18,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1027 transitions, 2130 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 13:25:18,991 INFO L231 Difference]: Finished difference. Result has 995 places, 1025 transitions, 2080 flow [2024-12-02 13:25:18,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=995, PETRI_TRANSITIONS=1025} [2024-12-02 13:25:18,992 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -41 predicate places. [2024-12-02 13:25:18,992 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1025 transitions, 2080 flow [2024-12-02 13:25:18,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:18,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:18,993 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] [2024-12-02 13:25:18,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 13:25:18,993 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:18,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1951763683, now seen corresponding path program 1 times [2024-12-02 13:25:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883282372] [2024-12-02 13:25:18,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883282372] [2024-12-02 13:25:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883282372] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:19,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120657177] [2024-12-02 13:25:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:19,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:19,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:19,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:19,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-12-02 13:25:19,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1025 transitions, 2080 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:19,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:19,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-12-02 13:25:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:19,559 INFO L124 PetriNetUnfolderBase]: 106/2076 cut-off events. [2024-12-02 13:25:19,559 INFO L125 PetriNetUnfolderBase]: For 21/44 co-relation queries the response was YES. [2024-12-02 13:25:19,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 2076 events. 106/2076 cut-off events. For 21/44 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11796 event pairs, 4 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 1930. Up to 48 conditions per place. [2024-12-02 13:25:19,615 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1026 dead transitions. [2024-12-02 13:25:19,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1026 transitions, 2120 flow [2024-12-02 13:25:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-12-02 13:25:19,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-12-02 13:25:19,617 INFO L175 Difference]: Start difference. First operand has 995 places, 1025 transitions, 2080 flow. Second operand 3 states and 3226 transitions. [2024-12-02 13:25:19,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1026 transitions, 2120 flow [2024-12-02 13:25:19,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1026 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:19,624 INFO L231 Difference]: Finished difference. Result has 994 places, 1024 transitions, 2078 flow [2024-12-02 13:25:19,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1024} [2024-12-02 13:25:19,625 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2024-12-02 13:25:19,625 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1024 transitions, 2078 flow [2024-12-02 13:25:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:19,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:19,626 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] [2024-12-02 13:25:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 13:25:19,626 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 380637946, now seen corresponding path program 1 times [2024-12-02 13:25:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727414872] [2024-12-02 13:25:19,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:19,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727414872] [2024-12-02 13:25:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727414872] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:19,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758526466] [2024-12-02 13:25:19,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:19,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:19,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:19,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:19,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-12-02 13:25:19,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1024 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:19,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:19,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-12-02 13:25:19,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:20,883 INFO L124 PetriNetUnfolderBase]: 192/3769 cut-off events. [2024-12-02 13:25:20,883 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-12-02 13:25:20,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 3769 events. 192/3769 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25710 event pairs, 8 based on Foata normal form. 0/3078 useless extension candidates. Maximal degree in co-relation 3434. Up to 42 conditions per place. [2024-12-02 13:25:21,004 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 18 selfloop transitions, 9 changer transitions 0/1025 dead transitions. [2024-12-02 13:25:21,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1025 transitions, 2136 flow [2024-12-02 13:25:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2024-12-02 13:25:21,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680530440024111 [2024-12-02 13:25:21,007 INFO L175 Difference]: Start difference. First operand has 994 places, 1024 transitions, 2078 flow. Second operand 3 states and 3212 transitions. [2024-12-02 13:25:21,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1025 transitions, 2136 flow [2024-12-02 13:25:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 1025 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:21,020 INFO L231 Difference]: Finished difference. Result has 990 places, 1023 transitions, 2107 flow [2024-12-02 13:25:21,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=990, PETRI_TRANSITIONS=1023} [2024-12-02 13:25:21,021 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2024-12-02 13:25:21,022 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1023 transitions, 2107 flow [2024-12-02 13:25:21,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:21,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:21,023 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] [2024-12-02 13:25:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 13:25:21,023 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 844263123, now seen corresponding path program 1 times [2024-12-02 13:25:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198795338] [2024-12-02 13:25:21,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198795338] [2024-12-02 13:25:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198795338] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321281043] [2024-12-02 13:25:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:21,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:21,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:21,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-12-02 13:25:21,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1023 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:21,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:21,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-12-02 13:25:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:22,181 INFO L124 PetriNetUnfolderBase]: 184/3664 cut-off events. [2024-12-02 13:25:22,181 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2024-12-02 13:25:22,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 3664 events. 184/3664 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28409 event pairs, 20 based on Foata normal form. 1/3008 useless extension candidates. Maximal degree in co-relation 3365. Up to 68 conditions per place. [2024-12-02 13:25:22,298 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 3 changer transitions 0/1024 dead transitions. [2024-12-02 13:25:22,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1024 transitions, 2161 flow [2024-12-02 13:25:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2024-12-02 13:25:22,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704641350210971 [2024-12-02 13:25:22,302 INFO L175 Difference]: Start difference. First operand has 990 places, 1023 transitions, 2107 flow. Second operand 3 states and 3220 transitions. [2024-12-02 13:25:22,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1024 transitions, 2161 flow [2024-12-02 13:25:22,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 1024 transitions, 2152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:25:22,310 INFO L231 Difference]: Finished difference. Result has 990 places, 1022 transitions, 2102 flow [2024-12-02 13:25:22,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1022, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=990, PETRI_TRANSITIONS=1022} [2024-12-02 13:25:22,311 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2024-12-02 13:25:22,312 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1022 transitions, 2102 flow [2024-12-02 13:25:22,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:22,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:22,312 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] [2024-12-02 13:25:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 13:25:22,312 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1453172312, now seen corresponding path program 1 times [2024-12-02 13:25:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186185367] [2024-12-02 13:25:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:22,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186185367] [2024-12-02 13:25:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186185367] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:22,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854202274] [2024-12-02 13:25:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:22,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:22,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:22,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:22,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-12-02 13:25:22,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1022 transitions, 2102 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) [2024-12-02 13:25:22,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:22,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-12-02 13:25:22,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:27,248 INFO L124 PetriNetUnfolderBase]: 1561/19942 cut-off events. [2024-12-02 13:25:27,248 INFO L125 PetriNetUnfolderBase]: For 144/150 co-relation queries the response was YES. [2024-12-02 13:25:27,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21179 conditions, 19942 events. 1561/19942 cut-off events. For 144/150 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223048 event pairs, 488 based on Foata normal form. 0/16094 useless extension candidates. Maximal degree in co-relation 16198. Up to 1175 conditions per place. [2024-12-02 13:25:27,527 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1016 dead transitions. [2024-12-02 13:25:27,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1016 transitions, 2154 flow [2024-12-02 13:25:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-12-02 13:25:27,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-12-02 13:25:27,530 INFO L175 Difference]: Start difference. First operand has 990 places, 1022 transitions, 2102 flow. Second operand 3 states and 3188 transitions. [2024-12-02 13:25:27,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1016 transitions, 2154 flow [2024-12-02 13:25:27,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 1016 transitions, 2148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:27,539 INFO L231 Difference]: Finished difference. Result has 981 places, 1014 transitions, 2090 flow [2024-12-02 13:25:27,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=981, PETRI_TRANSITIONS=1014} [2024-12-02 13:25:27,540 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -55 predicate places. [2024-12-02 13:25:27,540 INFO L471 AbstractCegarLoop]: Abstraction has has 981 places, 1014 transitions, 2090 flow [2024-12-02 13:25:27,541 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) [2024-12-02 13:25:27,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:27,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, 1, 1, 1, 1, 1] [2024-12-02 13:25:27,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 13:25:27,541 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 259721567, now seen corresponding path program 1 times [2024-12-02 13:25:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213856851] [2024-12-02 13:25:27,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213856851] [2024-12-02 13:25:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213856851] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270713514] [2024-12-02 13:25:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:27,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:25:27,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 1014 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:27,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:27,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:25:27,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:28,532 INFO L124 PetriNetUnfolderBase]: 181/3054 cut-off events. [2024-12-02 13:25:28,532 INFO L125 PetriNetUnfolderBase]: For 44/56 co-relation queries the response was YES. [2024-12-02 13:25:28,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 3054 events. 181/3054 cut-off events. For 44/56 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22346 event pairs, 37 based on Foata normal form. 1/2533 useless extension candidates. Maximal degree in co-relation 2509. Up to 139 conditions per place. [2024-12-02 13:25:28,616 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2024-12-02 13:25:28,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1015 transitions, 2142 flow [2024-12-02 13:25:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-12-02 13:25:28,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-12-02 13:25:28,619 INFO L175 Difference]: Start difference. First operand has 981 places, 1014 transitions, 2090 flow. Second operand 3 states and 3214 transitions. [2024-12-02 13:25:28,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1015 transitions, 2142 flow [2024-12-02 13:25:28,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1015 transitions, 2142 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 13:25:28,632 INFO L231 Difference]: Finished difference. Result has 982 places, 1013 transitions, 2092 flow [2024-12-02 13:25:28,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1013} [2024-12-02 13:25:28,634 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2024-12-02 13:25:28,634 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1013 transitions, 2092 flow [2024-12-02 13:25:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:28,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:28,635 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] [2024-12-02 13:25:28,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 13:25:28,636 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:28,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1811240253, now seen corresponding path program 1 times [2024-12-02 13:25:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:28,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754949506] [2024-12-02 13:25:28,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:28,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754949506] [2024-12-02 13:25:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754949506] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040958380] [2024-12-02 13:25:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:28,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-12-02 13:25:28,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1013 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:28,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:28,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-12-02 13:25:28,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:30,078 INFO L124 PetriNetUnfolderBase]: 298/5501 cut-off events. [2024-12-02 13:25:30,079 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2024-12-02 13:25:30,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 5501 events. 298/5501 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 44773 event pairs, 15 based on Foata normal form. 0/4550 useless extension candidates. Maximal degree in co-relation 5383. Up to 66 conditions per place. [2024-12-02 13:25:30,191 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 18 selfloop transitions, 9 changer transitions 0/1014 dead transitions. [2024-12-02 13:25:30,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1014 transitions, 2150 flow [2024-12-02 13:25:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2024-12-02 13:25:30,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680530440024111 [2024-12-02 13:25:30,193 INFO L175 Difference]: Start difference. First operand has 982 places, 1013 transitions, 2092 flow. Second operand 3 states and 3212 transitions. [2024-12-02 13:25:30,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1014 transitions, 2150 flow [2024-12-02 13:25:30,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 1014 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:30,206 INFO L231 Difference]: Finished difference. Result has 978 places, 1012 transitions, 2121 flow [2024-12-02 13:25:30,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=978, PETRI_TRANSITIONS=1012} [2024-12-02 13:25:30,208 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2024-12-02 13:25:30,208 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1012 transitions, 2121 flow [2024-12-02 13:25:30,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:30,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:30,209 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] [2024-12-02 13:25:30,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 13:25:30,209 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:30,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1011087137, now seen corresponding path program 1 times [2024-12-02 13:25:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106040813] [2024-12-02 13:25:30,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:30,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106040813] [2024-12-02 13:25:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106040813] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:30,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037935856] [2024-12-02 13:25:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:30,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:30,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:30,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:30,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-12-02 13:25:30,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1012 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:30,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:30,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-12-02 13:25:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:31,643 INFO L124 PetriNetUnfolderBase]: 285/5369 cut-off events. [2024-12-02 13:25:31,643 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2024-12-02 13:25:31,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 5369 events. 285/5369 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 47652 event pairs, 30 based on Foata normal form. 0/4449 useless extension candidates. Maximal degree in co-relation 5079. Up to 104 conditions per place. [2024-12-02 13:25:31,757 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2024-12-02 13:25:31,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1013 transitions, 2175 flow [2024-12-02 13:25:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2024-12-02 13:25:31,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704641350210971 [2024-12-02 13:25:31,759 INFO L175 Difference]: Start difference. First operand has 978 places, 1012 transitions, 2121 flow. Second operand 3 states and 3220 transitions. [2024-12-02 13:25:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1013 transitions, 2175 flow [2024-12-02 13:25:31,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1013 transitions, 2166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:25:31,767 INFO L231 Difference]: Finished difference. Result has 978 places, 1011 transitions, 2116 flow [2024-12-02 13:25:31,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=978, PETRI_TRANSITIONS=1011} [2024-12-02 13:25:31,768 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2024-12-02 13:25:31,768 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1011 transitions, 2116 flow [2024-12-02 13:25:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:31,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:31,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 13:25:31,769 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 903675522, now seen corresponding path program 1 times [2024-12-02 13:25:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3881284] [2024-12-02 13:25:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3881284] [2024-12-02 13:25:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3881284] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:25:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617078773] [2024-12-02 13:25:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:31,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:31,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-12-02 13:25:31,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1011 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:31,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:31,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-12-02 13:25:31,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:32,919 INFO L124 PetriNetUnfolderBase]: 215/4587 cut-off events. [2024-12-02 13:25:32,920 INFO L125 PetriNetUnfolderBase]: For 12/22 co-relation queries the response was YES. [2024-12-02 13:25:32,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 4587 events. 215/4587 cut-off events. For 12/22 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 38312 event pairs, 4 based on Foata normal form. 1/3825 useless extension candidates. Maximal degree in co-relation 4058. Up to 33 conditions per place. [2024-12-02 13:25:33,032 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1017 dead transitions. [2024-12-02 13:25:33,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 1017 transitions, 2173 flow [2024-12-02 13:25:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2024-12-02 13:25:33,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755877034358047 [2024-12-02 13:25:33,035 INFO L175 Difference]: Start difference. First operand has 978 places, 1011 transitions, 2116 flow. Second operand 3 states and 3237 transitions. [2024-12-02 13:25:33,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 1017 transitions, 2173 flow [2024-12-02 13:25:33,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1017 transitions, 2167 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:33,042 INFO L231 Difference]: Finished difference. Result has 980 places, 1012 transitions, 2124 flow [2024-12-02 13:25:33,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=980, PETRI_TRANSITIONS=1012} [2024-12-02 13:25:33,043 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -56 predicate places. [2024-12-02 13:25:33,043 INFO L471 AbstractCegarLoop]: Abstraction has has 980 places, 1012 transitions, 2124 flow [2024-12-02 13:25:33,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:33,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:33,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] [2024-12-02 13:25:33,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 13:25:33,043 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:33,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash -718718586, now seen corresponding path program 1 times [2024-12-02 13:25:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453207498] [2024-12-02 13:25:33,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453207498] [2024-12-02 13:25:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453207498] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698940329] [2024-12-02 13:25:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:33,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:33,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:33,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:33,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-12-02 13:25:33,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 1012 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:33,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:33,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-12-02 13:25:33,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:34,304 INFO L124 PetriNetUnfolderBase]: 255/4099 cut-off events. [2024-12-02 13:25:34,305 INFO L125 PetriNetUnfolderBase]: For 70/86 co-relation queries the response was YES. [2024-12-02 13:25:34,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 4099 events. 255/4099 cut-off events. For 70/86 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 32815 event pairs, 42 based on Foata normal form. 5/3438 useless extension candidates. Maximal degree in co-relation 3677. Up to 140 conditions per place. [2024-12-02 13:25:34,471 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 16 selfloop transitions, 8 changer transitions 12/1013 dead transitions. [2024-12-02 13:25:34,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 1013 transitions, 2180 flow [2024-12-02 13:25:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-12-02 13:25:34,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-12-02 13:25:34,474 INFO L175 Difference]: Start difference. First operand has 980 places, 1012 transitions, 2124 flow. Second operand 3 states and 3211 transitions. [2024-12-02 13:25:34,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 1013 transitions, 2180 flow [2024-12-02 13:25:34,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 1013 transitions, 2178 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:25:34,488 INFO L231 Difference]: Finished difference. Result has 977 places, 999 transitions, 2123 flow [2024-12-02 13:25:34,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=977, PETRI_TRANSITIONS=999} [2024-12-02 13:25:34,489 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -59 predicate places. [2024-12-02 13:25:34,489 INFO L471 AbstractCegarLoop]: Abstraction has has 977 places, 999 transitions, 2123 flow [2024-12-02 13:25:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:34,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:34,490 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] [2024-12-02 13:25:34,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 13:25:34,490 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2019923936, now seen corresponding path program 1 times [2024-12-02 13:25:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551691729] [2024-12-02 13:25:34,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551691729] [2024-12-02 13:25:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551691729] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768661907] [2024-12-02 13:25:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:34,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:34,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:34,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:34,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-12-02 13:25:34,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 999 transitions, 2123 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) [2024-12-02 13:25:34,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:34,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-12-02 13:25:34,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:37,246 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2024-12-02 13:25:37,247 INFO L125 PetriNetUnfolderBase]: For 80/116 co-relation queries the response was YES. [2024-12-02 13:25:37,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9907 conditions, 9044 events. 488/9044 cut-off events. For 80/116 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 83286 event pairs, 14 based on Foata normal form. 2/7652 useless extension candidates. Maximal degree in co-relation 9080. Up to 166 conditions per place. [2024-12-02 13:25:37,567 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2024-12-02 13:25:37,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2185 flow [2024-12-02 13:25:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-12-02 13:25:37,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-12-02 13:25:37,570 INFO L175 Difference]: Start difference. First operand has 977 places, 999 transitions, 2123 flow. Second operand 3 states and 3193 transitions. [2024-12-02 13:25:37,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2185 flow [2024-12-02 13:25:37,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:25:37,588 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2024-12-02 13:25:37,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2024-12-02 13:25:37,590 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2024-12-02 13:25:37,590 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2024-12-02 13:25:37,590 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) [2024-12-02 13:25:37,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:37,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 13:25:37,591 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash 515359711, now seen corresponding path program 1 times [2024-12-02 13:25:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169743334] [2024-12-02 13:25:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169743334] [2024-12-02 13:25:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169743334] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:37,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469600064] [2024-12-02 13:25:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:37,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:37,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:37,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:37,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:25:37,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:37,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:37,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:25:37,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:39,748 INFO L124 PetriNetUnfolderBase]: 367/7058 cut-off events. [2024-12-02 13:25:39,748 INFO L125 PetriNetUnfolderBase]: For 166/204 co-relation queries the response was YES. [2024-12-02 13:25:39,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 7058 events. 367/7058 cut-off events. For 166/204 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 68251 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6211. Up to 147 conditions per place. [2024-12-02 13:25:39,947 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2024-12-02 13:25:39,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2209 flow [2024-12-02 13:25:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:25:39,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:25:39,951 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:25:39,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2209 flow [2024-12-02 13:25:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:39,961 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2024-12-02 13:25:39,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, 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=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2024-12-02 13:25:39,962 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -76 predicate places. [2024-12-02 13:25:39,962 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2024-12-02 13:25:39,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:39,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:39,962 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] [2024-12-02 13:25:39,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 13:25:39,963 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash -959999567, now seen corresponding path program 1 times [2024-12-02 13:25:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872548383] [2024-12-02 13:25:39,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:39,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872548383] [2024-12-02 13:25:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872548383] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:39,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871317195] [2024-12-02 13:25:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:39,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:39,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:39,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:40,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-12-02 13:25:40,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:40,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:40,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-12-02 13:25:40,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:41,364 INFO L124 PetriNetUnfolderBase]: 243/3757 cut-off events. [2024-12-02 13:25:41,364 INFO L125 PetriNetUnfolderBase]: For 186/208 co-relation queries the response was YES. [2024-12-02 13:25:41,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 3757 events. 243/3757 cut-off events. For 186/208 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30977 event pairs, 36 based on Foata normal form. 1/3171 useless extension candidates. Maximal degree in co-relation 3592. Up to 212 conditions per place. [2024-12-02 13:25:41,450 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 20 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2024-12-02 13:25:41,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2187 flow [2024-12-02 13:25:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3218 transitions. [2024-12-02 13:25:41,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698613622664256 [2024-12-02 13:25:41,452 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3218 transitions. [2024-12-02 13:25:41,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2187 flow [2024-12-02 13:25:41,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:41,458 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2024-12-02 13:25:41,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2024-12-02 13:25:41,458 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -77 predicate places. [2024-12-02 13:25:41,458 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2024-12-02 13:25:41,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:41,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:41,459 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] [2024-12-02 13:25:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 13:25:41,459 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:41,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -967726965, now seen corresponding path program 1 times [2024-12-02 13:25:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896306015] [2024-12-02 13:25:41,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896306015] [2024-12-02 13:25:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896306015] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:41,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:25:41,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110714387] [2024-12-02 13:25:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:41,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:41,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:41,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:41,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-12-02 13:25:41,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:41,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:41,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-12-02 13:25:41,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:43,719 INFO L124 PetriNetUnfolderBase]: 267/5679 cut-off events. [2024-12-02 13:25:43,719 INFO L125 PetriNetUnfolderBase]: For 34/90 co-relation queries the response was YES. [2024-12-02 13:25:43,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 5679 events. 267/5679 cut-off events. For 34/90 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 50528 event pairs, 10 based on Foata normal form. 0/4793 useless extension candidates. Maximal degree in co-relation 4948. Up to 89 conditions per place. [2024-12-02 13:25:44,106 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2024-12-02 13:25:44,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2024-12-02 13:25:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3234 transitions. [2024-12-02 13:25:44,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746835443037974 [2024-12-02 13:25:44,107 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3234 transitions. [2024-12-02 13:25:44,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2024-12-02 13:25:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:44,115 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2024-12-02 13:25:44,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2024-12-02 13:25:44,116 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2024-12-02 13:25:44,116 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2024-12-02 13:25:44,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:44,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:44,116 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] [2024-12-02 13:25:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 13:25:44,116 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -846408055, now seen corresponding path program 1 times [2024-12-02 13:25:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:44,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436247556] [2024-12-02 13:25:44,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436247556] [2024-12-02 13:25:44,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436247556] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:44,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:44,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:44,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697261362] [2024-12-02 13:25:44,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:44,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:44,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:44,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:44,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-12-02 13:25:44,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 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) [2024-12-02 13:25:44,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:44,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-12-02 13:25:44,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:49,018 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2024-12-02 13:25:49,018 INFO L125 PetriNetUnfolderBase]: For 84/224 co-relation queries the response was YES. [2024-12-02 13:25:49,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 10693 events. 631/10693 cut-off events. For 84/224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 110824 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9698. Up to 336 conditions per place. [2024-12-02 13:25:49,543 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2024-12-02 13:25:49,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2024-12-02 13:25:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-12-02 13:25:49,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-12-02 13:25:49,546 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3193 transitions. [2024-12-02 13:25:49,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2024-12-02 13:25:49,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:25:49,562 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2024-12-02 13:25:49,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2024-12-02 13:25:49,563 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -80 predicate places. [2024-12-02 13:25:49,563 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2024-12-02 13:25:49,564 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) [2024-12-02 13:25:49,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:49,564 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] [2024-12-02 13:25:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 13:25:49,564 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1760353365, now seen corresponding path program 1 times [2024-12-02 13:25:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103378220] [2024-12-02 13:25:49,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103378220] [2024-12-02 13:25:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103378220] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679344044] [2024-12-02 13:25:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:49,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:49,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:49,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:49,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:25:49,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:49,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:49,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:25:49,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:53,327 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2024-12-02 13:25:53,327 INFO L125 PetriNetUnfolderBase]: For 386/624 co-relation queries the response was YES. [2024-12-02 13:25:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 8694 events. 484/8694 cut-off events. For 386/624 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 92137 event pairs, 95 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7926. Up to 284 conditions per place. [2024-12-02 13:25:53,921 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2024-12-02 13:25:53,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2024-12-02 13:25:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:25:53,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:25:53,923 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:25:53,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2024-12-02 13:25:53,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:53,934 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2024-12-02 13:25:53,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2024-12-02 13:25:53,934 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -81 predicate places. [2024-12-02 13:25:53,935 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2024-12-02 13:25:53,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:53,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:53,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:25:53,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 13:25:53,935 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:53,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -770634071, now seen corresponding path program 1 times [2024-12-02 13:25:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299805367] [2024-12-02 13:25:53,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299805367] [2024-12-02 13:25:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299805367] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:25:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413412632] [2024-12-02 13:25:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:53,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:54,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1106 [2024-12-02 13:25:54,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:54,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:54,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1106 [2024-12-02 13:25:54,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:25:56,094 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2024-12-02 13:25:56,094 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2024-12-02 13:25:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48404 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2024-12-02 13:25:56,335 INFO L140 encePairwiseOnDemand]: 1099/1106 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2024-12-02 13:25:56,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2024-12-02 13:25:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:25:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:25:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2024-12-02 13:25:56,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695599758890898 [2024-12-02 13:25:56,336 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3217 transitions. [2024-12-02 13:25:56,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2024-12-02 13:25:56,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:25:56,345 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2024-12-02 13:25:56,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2024-12-02 13:25:56,346 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -85 predicate places. [2024-12-02 13:25:56,346 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2024-12-02 13:25:56,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:56,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:25:56,346 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] [2024-12-02 13:25:56,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 13:25:56,346 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:25:56,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:25:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1648206478, now seen corresponding path program 1 times [2024-12-02 13:25:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:25:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016340533] [2024-12-02 13:25:56,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:25:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:25:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:25:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:25:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:25:56,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016340533] [2024-12-02 13:25:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016340533] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:25:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:25:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:25:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542202430] [2024-12-02 13:25:56,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:25:56,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:25:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:25:56,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:25:56,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:25:56,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-12-02 13:25:56,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:25:56,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:25:56,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-12-02 13:25:56,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:26:00,407 INFO L124 PetriNetUnfolderBase]: 386/8361 cut-off events. [2024-12-02 13:26:00,407 INFO L125 PetriNetUnfolderBase]: For 34/66 co-relation queries the response was YES. [2024-12-02 13:26:00,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 8361 events. 386/8361 cut-off events. For 34/66 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 76375 event pairs, 24 based on Foata normal form. 2/7038 useless extension candidates. Maximal degree in co-relation 7682. Up to 175 conditions per place. [2024-12-02 13:26:00,710 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2024-12-02 13:26:00,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2024-12-02 13:26:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:26:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:26:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2024-12-02 13:26:00,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743821579264618 [2024-12-02 13:26:00,711 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3233 transitions. [2024-12-02 13:26:00,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2024-12-02 13:26:00,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:26:00,720 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2024-12-02 13:26:00,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2024-12-02 13:26:00,721 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -83 predicate places. [2024-12-02 13:26:00,721 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2024-12-02 13:26:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:00,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:26:00,722 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] [2024-12-02 13:26:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 13:26:00,722 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:26:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:26:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash 509771372, now seen corresponding path program 1 times [2024-12-02 13:26:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:26:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707132930] [2024-12-02 13:26:00,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:26:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:26:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:26:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:26:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:26:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707132930] [2024-12-02 13:26:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707132930] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:26:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:26:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:26:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328994540] [2024-12-02 13:26:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:26:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:26:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:26:00,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:26:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:26:00,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-12-02 13:26:00,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 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) [2024-12-02 13:26:00,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:26:00,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-12-02 13:26:00,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:26:05,116 INFO L124 PetriNetUnfolderBase]: 702/10384 cut-off events. [2024-12-02 13:26:05,117 INFO L125 PetriNetUnfolderBase]: For 326/386 co-relation queries the response was YES. [2024-12-02 13:26:05,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 10384 events. 702/10384 cut-off events. For 326/386 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 115890 event pairs, 54 based on Foata normal form. 2/8868 useless extension candidates. Maximal degree in co-relation 10283. Up to 682 conditions per place. [2024-12-02 13:26:05,702 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2024-12-02 13:26:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2024-12-02 13:26:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:26:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:26:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-12-02 13:26:05,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-12-02 13:26:05,704 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3193 transitions. [2024-12-02 13:26:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2024-12-02 13:26:05,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 13:26:05,713 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2024-12-02 13:26:05,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2024-12-02 13:26:05,714 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -88 predicate places. [2024-12-02 13:26:05,714 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2024-12-02 13:26:05,714 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) [2024-12-02 13:26:05,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:26:05,714 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] [2024-12-02 13:26:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 13:26:05,715 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:26:05,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:26:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1626503485, now seen corresponding path program 1 times [2024-12-02 13:26:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:26:05,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212805474] [2024-12-02 13:26:05,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:26:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:26:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:26:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:26:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:26:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212805474] [2024-12-02 13:26:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212805474] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:26:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:26:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:26:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952091935] [2024-12-02 13:26:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:26:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:26:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:26:05,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:26:05,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:26:05,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-12-02 13:26:05,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:05,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:26:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-12-02 13:26:05,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:26:10,095 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2024-12-02 13:26:10,095 INFO L125 PetriNetUnfolderBase]: For 904/972 co-relation queries the response was YES. [2024-12-02 13:26:10,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 904/972 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 112628 event pairs, 190 based on Foata normal form. 2/8814 useless extension candidates. Maximal degree in co-relation 10447. Up to 585 conditions per place. [2024-12-02 13:26:10,658 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2024-12-02 13:26:10,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2024-12-02 13:26:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:26:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:26:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-12-02 13:26:10,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-12-02 13:26:10,660 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3213 transitions. [2024-12-02 13:26:10,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2024-12-02 13:26:10,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:26:10,671 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2024-12-02 13:26:10,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2024-12-02 13:26:10,671 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -89 predicate places. [2024-12-02 13:26:10,671 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2024-12-02 13:26:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:10,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:26:10,672 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] [2024-12-02 13:26:10,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 13:26:10,672 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:26:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:26:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash -682001163, now seen corresponding path program 1 times [2024-12-02 13:26:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:26:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772777986] [2024-12-02 13:26:10,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:26:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:26:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:26:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:26:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:26:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772777986] [2024-12-02 13:26:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772777986] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:26:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:26:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:26:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913686604] [2024-12-02 13:26:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:26:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:26:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:26:10,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:26:10,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:26:10,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1106 [2024-12-02 13:26:10,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:10,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:26:10,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1106 [2024-12-02 13:26:10,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:26:14,939 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2024-12-02 13:26:14,939 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2024-12-02 13:26:15,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 92269 event pairs, 11 based on Foata normal form. 1/7732 useless extension candidates. Maximal degree in co-relation 8449. Up to 204 conditions per place. [2024-12-02 13:26:15,556 INFO L140 encePairwiseOnDemand]: 1099/1106 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2024-12-02 13:26:15,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2024-12-02 13:26:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:26:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:26:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2024-12-02 13:26:15,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695599758890898 [2024-12-02 13:26:15,559 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3217 transitions. [2024-12-02 13:26:15,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2024-12-02 13:26:15,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:26:15,569 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2024-12-02 13:26:15,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2024-12-02 13:26:15,570 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -93 predicate places. [2024-12-02 13:26:15,570 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2024-12-02 13:26:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:15,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:26:15,570 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] [2024-12-02 13:26:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 13:26:15,571 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:26:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:26:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1604416733, now seen corresponding path program 1 times [2024-12-02 13:26:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:26:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546871883] [2024-12-02 13:26:15,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:26:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:26:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:26:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:26:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:26:15,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546871883] [2024-12-02 13:26:15,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546871883] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:26:15,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:26:15,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:26:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810329436] [2024-12-02 13:26:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:26:15,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:26:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:26:15,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:26:15,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:26:15,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1106 [2024-12-02 13:26:15,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:15,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:26:15,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1106 [2024-12-02 13:26:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:26:52,685 INFO L124 PetriNetUnfolderBase]: 7813/111926 cut-off events. [2024-12-02 13:26:52,685 INFO L125 PetriNetUnfolderBase]: For 428/508 co-relation queries the response was YES. [2024-12-02 13:26:55,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126176 conditions, 111926 events. 7813/111926 cut-off events. For 428/508 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 1867902 event pairs, 1056 based on Foata normal form. 2/95512 useless extension candidates. Maximal degree in co-relation 116655. Up to 4858 conditions per place. [2024-12-02 13:26:56,126 INFO L140 encePairwiseOnDemand]: 1100/1106 looper letters, 16 selfloop transitions, 3 changer transitions 0/981 dead transitions. [2024-12-02 13:26:56,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 981 transitions, 2225 flow [2024-12-02 13:26:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:26:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:26:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2024-12-02 13:26:56,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.974080771549126 [2024-12-02 13:26:56,128 INFO L175 Difference]: Start difference. First operand has 943 places, 977 transitions, 2175 flow. Second operand 3 states and 3232 transitions. [2024-12-02 13:26:56,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 981 transitions, 2225 flow [2024-12-02 13:26:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 981 transitions, 2219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:26:56,197 INFO L231 Difference]: Finished difference. Result has 941 places, 977 transitions, 2184 flow [2024-12-02 13:26:56,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=971, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2184, PETRI_PLACES=941, PETRI_TRANSITIONS=977} [2024-12-02 13:26:56,198 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -95 predicate places. [2024-12-02 13:26:56,198 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 977 transitions, 2184 flow [2024-12-02 13:26:56,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:56,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:26:56,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:26:56,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 13:26:56,199 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:26:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:26:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 642724294, now seen corresponding path program 1 times [2024-12-02 13:26:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:26:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793955134] [2024-12-02 13:26:56,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:26:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:26:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:26:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:26:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:26:56,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793955134] [2024-12-02 13:26:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793955134] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:26:56,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:26:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:26:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313565112] [2024-12-02 13:26:56,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:26:56,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:26:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:26:56,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:26:56,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:26:56,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1106 [2024-12-02 13:26:56,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 977 transitions, 2184 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:26:56,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:26:56,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1106 [2024-12-02 13:26:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:27:12,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,468 INFO L294 olderBase$Statistics]: this new event has 459 ancestors and is not cut-off event [2024-12-02 13:27:12,469 INFO L297 olderBase$Statistics]: existing Event has 549 ancestors and is not cut-off event [2024-12-02 13:27:12,469 INFO L297 olderBase$Statistics]: existing Event has 549 ancestors and is not cut-off event [2024-12-02 13:27:12,469 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is not cut-off event [2024-12-02 13:27:12,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, 1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,470 INFO L294 olderBase$Statistics]: this new event has 459 ancestors and is not cut-off event [2024-12-02 13:27:12,470 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is not cut-off event [2024-12-02 13:27:12,470 INFO L297 olderBase$Statistics]: existing Event has 549 ancestors and is not cut-off event [2024-12-02 13:27:12,470 INFO L297 olderBase$Statistics]: existing Event has 549 ancestors and is not cut-off event [2024-12-02 13:27:12,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,536 INFO L294 olderBase$Statistics]: this new event has 460 ancestors and is not cut-off event [2024-12-02 13:27:12,536 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-12-02 13:27:12,536 INFO L297 olderBase$Statistics]: existing Event has 550 ancestors and is not cut-off event [2024-12-02 13:27:12,536 INFO L297 olderBase$Statistics]: existing Event has 550 ancestors and is not cut-off event [2024-12-02 13:27:12,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,537 INFO L294 olderBase$Statistics]: this new event has 460 ancestors and is not cut-off event [2024-12-02 13:27:12,537 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-12-02 13:27:12,537 INFO L297 olderBase$Statistics]: existing Event has 550 ancestors and is not cut-off event [2024-12-02 13:27:12,537 INFO L297 olderBase$Statistics]: existing Event has 550 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,710 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, 1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,710 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,710 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,714 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, 1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,714 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,714 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,716 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,716 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,716 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,716 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,717 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,717 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,717 INFO L297 olderBase$Statistics]: existing Event has 553 ancestors and is not cut-off event [2024-12-02 13:27:12,717 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-12-02 13:27:12,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,749 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,749 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,749 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,753 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,753 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,753 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,756 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1197#(= ~name_3~0 ~name_1~0), 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,756 INFO L294 olderBase$Statistics]: this new event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,756 INFO L297 olderBase$Statistics]: existing Event has 554 ancestors and is not cut-off event [2024-12-02 13:27:12,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,857 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,857 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,857 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,858 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, 1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:12,858 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,858 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,858 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,858 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,860 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,860 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,860 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,860 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1168#true, 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:12,861 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:12,861 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,861 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:12,861 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:13,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,085 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:13,085 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:13,085 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:13,085 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:13,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,086 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-12-02 13:27:13,086 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:13,086 INFO L297 olderBase$Statistics]: existing Event has 557 ancestors and is not cut-off event [2024-12-02 13:27:13,086 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,112 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [1197#(= ~name_3~0 ~name_1~0), Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), 203#L138true, Black: 1166#(= |#race~result_12~0| 0), 1213#(= |#race~nondet_0~0| 0), Black: 1195#true, 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1202#(= |#race~break_15~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,112 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,112 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:13,114 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,114 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,114 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,114 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, 1181#(= ~name_3~0 ~name_2~0), Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1179#true]) [2024-12-02 13:27:13,115 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,115 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,115 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,115 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,118 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,118 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,118 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,118 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1159#true, Black: 1128#true, 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1168#true, Black: 1140#(= |#race~result_4~0| 0), 1147#(= |#race~name_3~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,118 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,119 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-12-02 13:27:13,119 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,119 INFO L297 olderBase$Statistics]: existing Event has 558 ancestors and is not cut-off event [2024-12-02 13:27:13,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 625#L106true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,195 INFO L294 olderBase$Statistics]: this new event has 471 ancestors and is not cut-off event [2024-12-02 13:27:13,195 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is not cut-off event [2024-12-02 13:27:13,195 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2024-12-02 13:27:13,195 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is not cut-off event [2024-12-02 13:27:13,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [909#L97true, Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), 1217#(= |#race~i_13~0| 0), Black: 1168#true, 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,196 INFO L294 olderBase$Statistics]: this new event has 471 ancestors and is not cut-off event [2024-12-02 13:27:13,196 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is not cut-off event [2024-12-02 13:27:13,196 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2024-12-02 13:27:13,196 INFO L297 olderBase$Statistics]: existing Event has 561 ancestors and is not cut-off event [2024-12-02 13:27:13,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 1126#(= |#race~name_1~0| 0), Black: 1145#true, 563#L106-1true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,220 INFO L294 olderBase$Statistics]: this new event has 472 ancestors and is not cut-off event [2024-12-02 13:27:13,220 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3287] thread2EXIT-->L138: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][970], [Black: 1154#(= |#race~result_8~0| 0), Black: 1184#true, 1130#(= |#race~name_2~0| 0), Black: 1124#true, Black: 1128#true, Black: 1161#(= ~name_2~0 ~name_1~0), Black: 1197#(= ~name_3~0 ~name_1~0), 203#L138true, 1213#(= |#race~nondet_0~0| 0), Black: 1166#(= |#race~result_12~0| 0), Black: 1202#(= |#race~break_15~0| 0), Black: 1168#true, 1217#(= |#race~i_13~0| 0), 1147#(= |#race~name_3~0| 0), Black: 1140#(= |#race~result_4~0| 0), 642#L97-1true, 1126#(= |#race~name_1~0| 0), Black: 1145#true, Black: 1211#true, Black: 1181#(= ~name_3~0 ~name_2~0)]) [2024-12-02 13:27:13,221 INFO L294 olderBase$Statistics]: this new event has 472 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is not cut-off event [2024-12-02 13:27:13,221 INFO L297 olderBase$Statistics]: existing Event has 562 ancestors and is not cut-off event [2024-12-02 13:27:13,471 INFO L124 PetriNetUnfolderBase]: 3032/41230 cut-off events. [2024-12-02 13:27:13,472 INFO L125 PetriNetUnfolderBase]: For 694/1537 co-relation queries the response was YES. [2024-12-02 13:27:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47491 conditions, 41230 events. 3032/41230 cut-off events. For 694/1537 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 593641 event pairs, 396 based on Foata normal form. 6/35456 useless extension candidates. Maximal degree in co-relation 42832. Up to 1612 conditions per place. [2024-12-02 13:27:15,048 INFO L140 encePairwiseOnDemand]: 1099/1106 looper letters, 15 selfloop transitions, 3 changer transitions 0/975 dead transitions. [2024-12-02 13:27:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 975 transitions, 2218 flow [2024-12-02 13:27:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:27:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:27:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2024-12-02 13:27:15,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695599758890898 [2024-12-02 13:27:15,050 INFO L175 Difference]: Start difference. First operand has 941 places, 977 transitions, 2184 flow. Second operand 3 states and 3217 transitions. [2024-12-02 13:27:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 975 transitions, 2218 flow [2024-12-02 13:27:15,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 975 transitions, 2218 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 13:27:15,065 INFO L231 Difference]: Finished difference. Result has 939 places, 973 transitions, 2182 flow [2024-12-02 13:27:15,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2182, PETRI_PLACES=939, PETRI_TRANSITIONS=973} [2024-12-02 13:27:15,066 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -97 predicate places. [2024-12-02 13:27:15,066 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 973 transitions, 2182 flow [2024-12-02 13:27:15,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:27:15,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:27:15,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:27:15,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 13:27:15,067 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:27:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:27:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 952272292, now seen corresponding path program 1 times [2024-12-02 13:27:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:27:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052848165] [2024-12-02 13:27:15,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:27:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:27:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:27:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:27:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:27:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052848165] [2024-12-02 13:27:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052848165] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:27:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:27:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 13:27:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818265963] [2024-12-02 13:27:15,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:27:15,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:27:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:27:15,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:27:15,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:27:15,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-12-02 13:27:15,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 973 transitions, 2182 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:27:15,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:27:15,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-12-02 13:27:15,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:28:01,029 INFO L124 PetriNetUnfolderBase]: 6330/124463 cut-off events. [2024-12-02 13:28:01,029 INFO L125 PetriNetUnfolderBase]: For 103/167 co-relation queries the response was YES. [2024-12-02 13:28:04,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138641 conditions, 124463 events. 6330/124463 cut-off events. For 103/167 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 2062926 event pairs, 318 based on Foata normal form. 8/108563 useless extension candidates. Maximal degree in co-relation 134085. Up to 2272 conditions per place. [2024-12-02 13:28:05,067 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 20 selfloop transitions, 3 changer transitions 0/974 dead transitions. [2024-12-02 13:28:05,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 974 transitions, 2232 flow [2024-12-02 13:28:05,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:28:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:28:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3218 transitions. [2024-12-02 13:28:05,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698613622664256 [2024-12-02 13:28:05,069 INFO L175 Difference]: Start difference. First operand has 939 places, 973 transitions, 2182 flow. Second operand 3 states and 3218 transitions. [2024-12-02 13:28:05,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 974 transitions, 2232 flow [2024-12-02 13:28:05,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 974 transitions, 2226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:28:05,113 INFO L231 Difference]: Finished difference. Result has 938 places, 972 transitions, 2180 flow [2024-12-02 13:28:05,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2180, PETRI_PLACES=938, PETRI_TRANSITIONS=972} [2024-12-02 13:28:05,114 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -98 predicate places. [2024-12-02 13:28:05,114 INFO L471 AbstractCegarLoop]: Abstraction has has 938 places, 972 transitions, 2180 flow [2024-12-02 13:28:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:05,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:28:05,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:28:05,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 13:28:05,115 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:28:05,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:28:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1026514894, now seen corresponding path program 1 times [2024-12-02 13:28:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:28:05,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655940396] [2024-12-02 13:28:05,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:28:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:28:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:28:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:28:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:28:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655940396] [2024-12-02 13:28:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655940396] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:28:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:28:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:28:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141141890] [2024-12-02 13:28:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:28:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:28:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:28:05,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:28:05,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:28:05,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1106 [2024-12-02 13:28:05,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 972 transitions, 2180 flow. Second operand has 4 states, 4 states have (on average 1072.75) internal successors, (4291), 4 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:05,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:28:05,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1106 [2024-12-02 13:28:05,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:28:34,047 INFO L124 PetriNetUnfolderBase]: 4038/72867 cut-off events. [2024-12-02 13:28:34,047 INFO L125 PetriNetUnfolderBase]: For 44/218 co-relation queries the response was YES. [2024-12-02 13:28:36,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80898 conditions, 72867 events. 4038/72867 cut-off events. For 44/218 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 1068319 event pairs, 306 based on Foata normal form. 12/63135 useless extension candidates. Maximal degree in co-relation 80732. Up to 1574 conditions per place. [2024-12-02 13:28:36,938 INFO L140 encePairwiseOnDemand]: 1098/1106 looper letters, 19 selfloop transitions, 8 changer transitions 0/985 dead transitions. [2024-12-02 13:28:36,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 985 transitions, 2268 flow [2024-12-02 13:28:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:28:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 13:28:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5383 transitions. [2024-12-02 13:28:36,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9734177215189873 [2024-12-02 13:28:36,941 INFO L175 Difference]: Start difference. First operand has 938 places, 972 transitions, 2180 flow. Second operand 5 states and 5383 transitions. [2024-12-02 13:28:36,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 985 transitions, 2268 flow [2024-12-02 13:28:36,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 985 transitions, 2262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:28:36,964 INFO L231 Difference]: Finished difference. Result has 943 places, 976 transitions, 2220 flow [2024-12-02 13:28:36,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=965, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2220, PETRI_PLACES=943, PETRI_TRANSITIONS=976} [2024-12-02 13:28:36,965 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -93 predicate places. [2024-12-02 13:28:36,965 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 976 transitions, 2220 flow [2024-12-02 13:28:36,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1072.75) internal successors, (4291), 4 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:36,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:28:36,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:28:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 13:28:36,966 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:28:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:28:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1059523224, now seen corresponding path program 1 times [2024-12-02 13:28:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:28:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558428070] [2024-12-02 13:28:36,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:28:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:28:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:28:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:28:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:28:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558428070] [2024-12-02 13:28:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558428070] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:28:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:28:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:28:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474777719] [2024-12-02 13:28:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:28:37,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:28:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:28:37,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:28:37,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:28:37,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1106 [2024-12-02 13:28:37,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 976 transitions, 2220 flow. Second operand has 5 states, 5 states have (on average 1072.8) internal successors, (5364), 5 states have internal predecessors, (5364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:37,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:28:37,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1106 [2024-12-02 13:28:37,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:28:53,745 INFO L124 PetriNetUnfolderBase]: 2138/37714 cut-off events. [2024-12-02 13:28:53,745 INFO L125 PetriNetUnfolderBase]: For 43/99 co-relation queries the response was YES. [2024-12-02 13:28:54,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41806 conditions, 37714 events. 2138/37714 cut-off events. For 43/99 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 486178 event pairs, 208 based on Foata normal form. 1/32599 useless extension candidates. Maximal degree in co-relation 41472. Up to 950 conditions per place. [2024-12-02 13:28:55,223 INFO L140 encePairwiseOnDemand]: 1099/1106 looper letters, 9 selfloop transitions, 6 changer transitions 0/977 dead transitions. [2024-12-02 13:28:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 977 transitions, 2252 flow [2024-12-02 13:28:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:28:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 13:28:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5371 transitions. [2024-12-02 13:28:55,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.97124773960217 [2024-12-02 13:28:55,226 INFO L175 Difference]: Start difference. First operand has 943 places, 976 transitions, 2220 flow. Second operand 5 states and 5371 transitions. [2024-12-02 13:28:55,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 977 transitions, 2252 flow [2024-12-02 13:28:55,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 977 transitions, 2252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 13:28:55,238 INFO L231 Difference]: Finished difference. Result has 948 places, 977 transitions, 2240 flow [2024-12-02 13:28:55,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2240, PETRI_PLACES=948, PETRI_TRANSITIONS=977} [2024-12-02 13:28:55,239 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -88 predicate places. [2024-12-02 13:28:55,239 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 977 transitions, 2240 flow [2024-12-02 13:28:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1072.8) internal successors, (5364), 5 states have internal predecessors, (5364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:55,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:28:55,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:28:55,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 13:28:55,240 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:28:55,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:28:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1869991626, now seen corresponding path program 1 times [2024-12-02 13:28:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:28:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984100826] [2024-12-02 13:28:55,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:28:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:28:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:28:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:28:55,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:28:55,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984100826] [2024-12-02 13:28:55,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984100826] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 13:28:55,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891679741] [2024-12-02 13:28:55,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:28:55,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 13:28:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:28:55,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 13:28:55,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 13:28:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:28:55,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 13:28:55,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 13:28:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:28:55,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 13:28:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:28:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891679741] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 13:28:55,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 13:28:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-12-02 13:28:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934379446] [2024-12-02 13:28:55,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 13:28:55,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 13:28:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:28:55,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 13:28:55,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-12-02 13:28:55,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-12-02 13:28:55,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 977 transitions, 2240 flow. Second operand has 14 states, 14 states have (on average 1070.0) internal successors, (14980), 14 states have internal predecessors, (14980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:28:55,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:28:55,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-12-02 13:28:55,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:29:12,790 INFO L124 PetriNetUnfolderBase]: 2138/37731 cut-off events. [2024-12-02 13:29:12,790 INFO L125 PetriNetUnfolderBase]: For 48/104 co-relation queries the response was YES. [2024-12-02 13:29:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41846 conditions, 37731 events. 2138/37731 cut-off events. For 48/104 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 485997 event pairs, 208 based on Foata normal form. 2/32617 useless extension candidates. Maximal degree in co-relation 41582. Up to 950 conditions per place. [2024-12-02 13:29:14,482 INFO L140 encePairwiseOnDemand]: 1096/1106 looper letters, 13 selfloop transitions, 13 changer transitions 0/985 dead transitions. [2024-12-02 13:29:14,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 985 transitions, 2310 flow [2024-12-02 13:29:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:29:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 13:29:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11776 transitions. [2024-12-02 13:29:14,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9679434489561072 [2024-12-02 13:29:14,488 INFO L175 Difference]: Start difference. First operand has 948 places, 977 transitions, 2240 flow. Second operand 11 states and 11776 transitions. [2024-12-02 13:29:14,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 985 transitions, 2310 flow [2024-12-02 13:29:14,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 985 transitions, 2300 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 13:29:14,510 INFO L231 Difference]: Finished difference. Result has 958 places, 983 transitions, 2290 flow [2024-12-02 13:29:14,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2290, PETRI_PLACES=958, PETRI_TRANSITIONS=983} [2024-12-02 13:29:14,511 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -78 predicate places. [2024-12-02 13:29:14,512 INFO L471 AbstractCegarLoop]: Abstraction has has 958 places, 983 transitions, 2290 flow [2024-12-02 13:29:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1070.0) internal successors, (14980), 14 states have internal predecessors, (14980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:29:14,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:29:14,514 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:29:14,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 13:29:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54db7a71-65e1-47c0-aca3-379b460c6c7d/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-12-02 13:29:14,715 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:29:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:29:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -408600842, now seen corresponding path program 2 times [2024-12-02 13:29:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:29:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431849387] [2024-12-02 13:29:14,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:29:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:29:14,739 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 13:29:14,740 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:29:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-02 13:29:15,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:29:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431849387] [2024-12-02 13:29:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431849387] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:29:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:29:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:29:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687658256] [2024-12-02 13:29:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:29:15,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:29:15,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:29:15,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:29:15,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:29:15,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-12-02 13:29:15,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 983 transitions, 2290 flow. Second operand has 6 states, 6 states have (on average 1066.5) internal successors, (6399), 6 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:29:15,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:29:15,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-12-02 13:29:15,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:29:34,937 INFO L124 PetriNetUnfolderBase]: 2508/44334 cut-off events. [2024-12-02 13:29:34,937 INFO L125 PetriNetUnfolderBase]: For 86/219 co-relation queries the response was YES. [2024-12-02 13:29:36,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49405 conditions, 44334 events. 2508/44334 cut-off events. For 86/219 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 586582 event pairs, 230 based on Foata normal form. 52/38471 useless extension candidates. Maximal degree in co-relation 49122. Up to 1042 conditions per place. [2024-12-02 13:29:36,989 INFO L140 encePairwiseOnDemand]: 1100/1106 looper letters, 23 selfloop transitions, 6 changer transitions 0/990 dead transitions. [2024-12-02 13:29:36,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 990 transitions, 2370 flow [2024-12-02 13:29:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:29:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 13:29:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6413 transitions. [2024-12-02 13:29:36,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663954189270645 [2024-12-02 13:29:36,991 INFO L175 Difference]: Start difference. First operand has 958 places, 983 transitions, 2290 flow. Second operand 6 states and 6413 transitions. [2024-12-02 13:29:36,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 990 transitions, 2370 flow [2024-12-02 13:29:37,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 990 transitions, 2358 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-12-02 13:29:37,008 INFO L231 Difference]: Finished difference. Result has 959 places, 982 transitions, 2288 flow [2024-12-02 13:29:37,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=954, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2288, PETRI_PLACES=959, PETRI_TRANSITIONS=982} [2024-12-02 13:29:37,009 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -77 predicate places. [2024-12-02 13:29:37,009 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 982 transitions, 2288 flow [2024-12-02 13:29:37,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1066.5) internal successors, (6399), 6 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:29:37,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:29:37,010 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:29:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 13:29:37,010 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-12-02 13:29:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:29:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash 859576205, now seen corresponding path program 1 times [2024-12-02 13:29:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:29:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220937704] [2024-12-02 13:29:37,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:29:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:29:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:29:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-02 13:29:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:29:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220937704] [2024-12-02 13:29:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220937704] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:29:37,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:29:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:29:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021915455] [2024-12-02 13:29:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:29:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:29:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:29:37,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:29:37,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:29:37,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1106 [2024-12-02 13:29:37,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 982 transitions, 2288 flow. Second operand has 4 states, 4 states have (on average 1073.0) internal successors, (4292), 4 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:29:37,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:29:37,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1106 [2024-12-02 13:29:37,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand