./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/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_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/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_bb17b474-f21c-40e3-a0e6-34679bdca9ca/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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 06:17:54,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 06:17:54,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 06:17:54,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 06:17:54,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 06:17:54,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 06:17:54,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 06:17:54,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 06:17:54,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 06:17:54,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 06:17:54,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 06:17:54,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 06:17:54,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 06:17:54,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 06:17:54,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 06:17:54,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 06:17:54,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:17:54,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:17:54,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:17:54,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 06:17:54,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:17:54,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 06:17:54,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 06:17:54,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 06:17:54,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 06:17:54,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 06:17:54,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 06:17:54,989 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_bb17b474-f21c-40e3-a0e6-34679bdca9ca/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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2024-12-02 06:17:55,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 06:17:55,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 06:17:55,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 06:17:55,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 06:17:55,250 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 06:17:55,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-12-02 06:17:58,214 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/data/83595d548/d949a61dfcc5422a8f1ba61e9c2da9a4/FLAGaa43b82e9 [2024-12-02 06:17:58,440 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 06:17:58,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-12-02 06:17:58,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/data/83595d548/d949a61dfcc5422a8f1ba61e9c2da9a4/FLAGaa43b82e9 [2024-12-02 06:17:58,468 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/data/83595d548/d949a61dfcc5422a8f1ba61e9c2da9a4 [2024-12-02 06:17:58,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 06:17:58,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 06:17:58,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 06:17:58,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 06:17:58,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 06:17:58,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d0cf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58, skipping insertion in model container [2024-12-02 06:17:58,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 06:17:58,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:17:58,698 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 06:17:58,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 06:17:58,750 INFO L204 MainTranslator]: Completed translation [2024-12-02 06:17:58,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58 WrapperNode [2024-12-02 06:17:58,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 06:17:58,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 06:17:58,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 06:17:58,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 06:17:58,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,797 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 587 [2024-12-02 06:17:58,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 06:17:58,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 06:17:58,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 06:17:58,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 06:17:58,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 06:17:58,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 06:17:58,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 06:17:58,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 06:17:58,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (1/1) ... [2024-12-02 06:17:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 06:17:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:17:58,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 06:17:58,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 06:17:58,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 06:17:58,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 06:17:58,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 06:17:58,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 06:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 06:17:58,893 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 06:17:58,999 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 06:17:59,000 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 06:17:59,673 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 06:17:59,673 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 06:17:59,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 06:17:59,696 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-02 06:17:59,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:17:59 BoogieIcfgContainer [2024-12-02 06:17:59,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 06:17:59,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 06:17:59,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 06:17:59,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 06:17:59,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:17:58" (1/3) ... [2024-12-02 06:17:59,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259dd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:17:59, skipping insertion in model container [2024-12-02 06:17:59,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:17:58" (2/3) ... [2024-12-02 06:17:59,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3259dd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:17:59, skipping insertion in model container [2024-12-02 06:17:59,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:17:59" (3/3) ... [2024-12-02 06:17:59,706 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2024-12-02 06:17:59,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 06:17:59,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 734 locations, 1 initial locations, 3 loop locations, and 102 error locations. [2024-12-02 06:17:59,718 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 06:17:59,836 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-02 06:17:59,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 774 transitions, 1562 flow [2024-12-02 06:18:00,114 INFO L124 PetriNetUnfolderBase]: 41/772 cut-off events. [2024-12-02 06:18:00,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-12-02 06:18:00,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 772 events. 41/772 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2013 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2024-12-02 06:18:00,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 774 transitions, 1562 flow [2024-12-02 06:18:00,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 750 transitions, 1512 flow [2024-12-02 06:18:00,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 06:18:00,161 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;@302387bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 06:18:00,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2024-12-02 06:18:00,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 06:18:00,166 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-12-02 06:18:00,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 06:18:00,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:00,167 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] [2024-12-02 06:18:00,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -383353773, now seen corresponding path program 1 times [2024-12-02 06:18:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778900764] [2024-12-02 06:18:00,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:00,308 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 06:18:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778900764] [2024-12-02 06:18:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778900764] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831901131] [2024-12-02 06:18:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:00,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:00,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:00,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:00,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:00,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 750 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:00,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:00,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:00,915 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-12-02 06:18:00,916 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-12-02 06:18:00,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15134 event pairs, 35 based on Foata normal form. 66/1971 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2024-12-02 06:18:00,937 INFO L140 encePairwiseOnDemand]: 758/774 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2024-12-02 06:18:00,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2024-12-02 06:18:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-12-02 06:18:00,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-12-02 06:18:00,957 INFO L175 Difference]: Start difference. First operand has 718 places, 750 transitions, 1512 flow. Second operand 3 states and 2247 transitions. [2024-12-02 06:18:00,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2024-12-02 06:18:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 06:18:00,977 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2024-12-02 06:18:00,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=715, PETRI_TRANSITIONS=734} [2024-12-02 06:18:00,982 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2024-12-02 06:18:00,982 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2024-12-02 06:18:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:00,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:00,984 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] [2024-12-02 06:18:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 06:18:00,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash -478582244, now seen corresponding path program 1 times [2024-12-02 06:18:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840536086] [2024-12-02 06:18:00,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:01,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 06:18:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840536086] [2024-12-02 06:18:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840536086] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:01,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937790450] [2024-12-02 06:18:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:01,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:01,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:01,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:01,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:01,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:01,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:01,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:01,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:01,603 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-12-02 06:18:01,603 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-12-02 06:18:01,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2402 events. 133/2402 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14664 event pairs, 35 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2467. Up to 88 conditions per place. [2024-12-02 06:18:01,620 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-12-02 06:18:01,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2024-12-02 06:18:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-12-02 06:18:01,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-12-02 06:18:01,625 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2024-12-02 06:18:01,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2024-12-02 06:18:01,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:01,632 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2024-12-02 06:18:01,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2024-12-02 06:18:01,633 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2024-12-02 06:18:01,634 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2024-12-02 06:18:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:01,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:01,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] [2024-12-02 06:18:01,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 06:18:01,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:01,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2055330758, now seen corresponding path program 1 times [2024-12-02 06:18:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:01,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635129861] [2024-12-02 06:18:01,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:01,679 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 06:18:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635129861] [2024-12-02 06:18:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635129861] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100752585] [2024-12-02 06:18:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:01,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:01,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:01,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:01,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:01,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:01,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:01,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:01,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:02,160 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2024-12-02 06:18:02,160 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-12-02 06:18:02,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2940 events. 130/2940 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17874 event pairs, 8 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2946. Up to 34 conditions per place. [2024-12-02 06:18:02,180 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-12-02 06:18:02,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2024-12-02 06:18:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-12-02 06:18:02,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-12-02 06:18:02,185 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2024-12-02 06:18:02,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2024-12-02 06:18:02,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:02,192 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2024-12-02 06:18:02,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2024-12-02 06:18:02,194 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2024-12-02 06:18:02,194 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2024-12-02 06:18:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:02,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:02,195 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] [2024-12-02 06:18:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 06:18:02,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 510051914, now seen corresponding path program 1 times [2024-12-02 06:18:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634845493] [2024-12-02 06:18:02,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:02,245 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 06:18:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634845493] [2024-12-02 06:18:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634845493] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590415714] [2024-12-02 06:18:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:02,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:02,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:02,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:02,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-12-02 06:18:02,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 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 06:18:02,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:02,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-12-02 06:18:02,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:02,557 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2024-12-02 06:18:02,557 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-02 06:18:02,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 1006 events. 44/1006 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3888 event pairs, 6 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 994. Up to 26 conditions per place. [2024-12-02 06:18:02,577 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-12-02 06:18:02,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2024-12-02 06:18:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-12-02 06:18:02,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-12-02 06:18:02,583 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2024-12-02 06:18:02,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2024-12-02 06:18:02,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:02,595 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2024-12-02 06:18:02,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2024-12-02 06:18:02,597 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2024-12-02 06:18:02,597 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2024-12-02 06:18:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 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 06:18:02,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:02,599 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] [2024-12-02 06:18:02,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 06:18:02,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:02,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1011653337, now seen corresponding path program 1 times [2024-12-02 06:18:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809246019] [2024-12-02 06:18:02,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:02,647 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 06:18:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809246019] [2024-12-02 06:18:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809246019] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561990269] [2024-12-02 06:18:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:02,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:02,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:02,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-12-02 06:18:02,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 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 06:18:02,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:02,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-12-02 06:18:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:03,125 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2024-12-02 06:18:03,126 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-12-02 06:18:03,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 2110 events. 91/2110 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10571 event pairs, 5 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2086. Up to 23 conditions per place. [2024-12-02 06:18:03,152 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-12-02 06:18:03,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2024-12-02 06:18:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-12-02 06:18:03,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-12-02 06:18:03,158 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2024-12-02 06:18:03,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2024-12-02 06:18:03,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:03,170 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2024-12-02 06:18:03,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2024-12-02 06:18:03,172 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2024-12-02 06:18:03,172 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2024-12-02 06:18:03,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 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 06:18:03,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:03,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:18:03,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 06:18:03,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:03,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1429325745, now seen corresponding path program 1 times [2024-12-02 06:18:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286719072] [2024-12-02 06:18:03,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:03,230 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 06:18:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286719072] [2024-12-02 06:18:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286719072] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:03,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296209834] [2024-12-02 06:18:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:03,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:03,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:03,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:03,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-12-02 06:18:03,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:03,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:03,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-12-02 06:18:03,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:04,085 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2024-12-02 06:18:04,085 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-12-02 06:18:04,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 4041 events. 182/4041 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 28046 event pairs, 12 based on Foata normal form. 0/3194 useless extension candidates. Maximal degree in co-relation 4037. Up to 44 conditions per place. [2024-12-02 06:18:04,117 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-12-02 06:18:04,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2024-12-02 06:18:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-12-02 06:18:04,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-12-02 06:18:04,123 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2024-12-02 06:18:04,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2024-12-02 06:18:04,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:04,134 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2024-12-02 06:18:04,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2024-12-02 06:18:04,136 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2024-12-02 06:18:04,136 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2024-12-02 06:18:04,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:04,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:04,138 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] [2024-12-02 06:18:04,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 06:18:04,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:04,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash 765645851, now seen corresponding path program 1 times [2024-12-02 06:18:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:04,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330536235] [2024-12-02 06:18:04,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:04,187 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 06:18:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330536235] [2024-12-02 06:18:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330536235] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783441] [2024-12-02 06:18:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:04,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:04,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:04,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:04,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:04,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:04,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:04,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:04,433 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2024-12-02 06:18:04,433 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-12-02 06:18:04,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 987 events. 46/987 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3791 event pairs, 8 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2024-12-02 06:18:04,449 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-12-02 06:18:04,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2024-12-02 06:18:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-12-02 06:18:04,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-12-02 06:18:04,454 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2024-12-02 06:18:04,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2024-12-02 06:18:04,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:04,465 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2024-12-02 06:18:04,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2024-12-02 06:18:04,467 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2024-12-02 06:18:04,467 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2024-12-02 06:18:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:04,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:04,469 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] [2024-12-02 06:18:04,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 06:18:04,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2129862914, now seen corresponding path program 1 times [2024-12-02 06:18:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196553178] [2024-12-02 06:18:04,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:04,515 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 06:18:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196553178] [2024-12-02 06:18:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196553178] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104653471] [2024-12-02 06:18:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:04,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:04,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:04,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:04,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-12-02 06:18:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 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 06:18:04,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:04,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-12-02 06:18:04,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:04,719 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2024-12-02 06:18:04,719 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-12-02 06:18:04,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 1002 events. 44/1002 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3573 event pairs, 6 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2024-12-02 06:18:04,734 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-12-02 06:18:04,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2024-12-02 06:18:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-12-02 06:18:04,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-12-02 06:18:04,737 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2024-12-02 06:18:04,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2024-12-02 06:18:04,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:04,746 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2024-12-02 06:18:04,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2024-12-02 06:18:04,747 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-12-02 06:18:04,748 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2024-12-02 06:18:04,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 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 06:18:04,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:04,750 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] [2024-12-02 06:18:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 06:18:04,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -991558104, now seen corresponding path program 1 times [2024-12-02 06:18:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724921927] [2024-12-02 06:18:04,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:04,802 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 06:18:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724921927] [2024-12-02 06:18:04,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724921927] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:04,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:04,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:04,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336931957] [2024-12-02 06:18:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:04,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:04,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:04,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:04,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-12-02 06:18:04,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 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 06:18:04,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:04,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-12-02 06:18:04,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:04,972 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2024-12-02 06:18:04,972 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-12-02 06:18:04,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 736 events. 31/736 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2475 event pairs, 5 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 675. Up to 23 conditions per place. [2024-12-02 06:18:04,985 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-12-02 06:18:04,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2024-12-02 06:18:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-12-02 06:18:04,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-12-02 06:18:04,987 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2024-12-02 06:18:04,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2024-12-02 06:18:04,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:04,993 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2024-12-02 06:18:04,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2024-12-02 06:18:04,995 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2024-12-02 06:18:04,995 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2024-12-02 06:18:04,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 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 06:18:04,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:04,996 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] [2024-12-02 06:18:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 06:18:04,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:04,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1860382154, now seen corresponding path program 1 times [2024-12-02 06:18:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968352896] [2024-12-02 06:18:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:05,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 06:18:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:05,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968352896] [2024-12-02 06:18:05,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968352896] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:05,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813540619] [2024-12-02 06:18:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:05,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:05,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:05,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:05,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-12-02 06:18:05,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:05,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:05,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-12-02 06:18:05,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:05,238 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2024-12-02 06:18:05,238 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-12-02 06:18:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1000 events. 50/1000 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4118 event pairs, 12 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 952. Up to 44 conditions per place. [2024-12-02 06:18:05,248 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-12-02 06:18:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2024-12-02 06:18:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-12-02 06:18:05,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-12-02 06:18:05,250 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2024-12-02 06:18:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2024-12-02 06:18:05,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:05,257 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2024-12-02 06:18:05,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=704, PETRI_TRANSITIONS=725} [2024-12-02 06:18:05,259 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2024-12-02 06:18:05,259 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2024-12-02 06:18:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:05,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:05,261 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] [2024-12-02 06:18:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 06:18:05,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2092362532, now seen corresponding path program 1 times [2024-12-02 06:18:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094240918] [2024-12-02 06:18:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:05,907 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 06:18:05,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094240918] [2024-12-02 06:18:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094240918] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:05,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:18:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420924985] [2024-12-02 06:18:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:05,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:18:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:05,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:18:05,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:18:06,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 774 [2024-12-02 06:18:06,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 725 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 0 states have call successors, (0), 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 06:18:06,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:06,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 774 [2024-12-02 06:18:06,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:06,629 INFO L124 PetriNetUnfolderBase]: 131/2347 cut-off events. [2024-12-02 06:18:06,629 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-12-02 06:18:06,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 2347 events. 131/2347 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 13184 event pairs, 24 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2339. Up to 84 conditions per place. [2024-12-02 06:18:06,649 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 20 selfloop transitions, 5 changer transitions 0/724 dead transitions. [2024-12-02 06:18:06,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1506 flow [2024-12-02 06:18:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:18:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 06:18:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2024-12-02 06:18:06,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526270456503014 [2024-12-02 06:18:06,656 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 6 states and 4424 transitions. [2024-12-02 06:18:06,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1506 flow [2024-12-02 06:18:06,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 724 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:06,663 INFO L231 Difference]: Finished difference. Result has 706 places, 724 transitions, 1462 flow [2024-12-02 06:18:06,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=724} [2024-12-02 06:18:06,664 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-12-02 06:18:06,665 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 724 transitions, 1462 flow [2024-12-02 06:18:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 0 states have call successors, (0), 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 06:18:06,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:06,666 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] [2024-12-02 06:18:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 06:18:06,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 282102408, now seen corresponding path program 1 times [2024-12-02 06:18:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025664042] [2024-12-02 06:18:06,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:06,706 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 06:18:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:06,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025664042] [2024-12-02 06:18:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025664042] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783486294] [2024-12-02 06:18:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:06,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-12-02 06:18:06,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 724 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 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 06:18:06,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:06,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-12-02 06:18:06,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:06,883 INFO L124 PetriNetUnfolderBase]: 52/1222 cut-off events. [2024-12-02 06:18:06,883 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-12-02 06:18:06,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1222 events. 52/1222 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4250 event pairs, 3 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1234. Up to 18 conditions per place. [2024-12-02 06:18:06,895 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 9 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-12-02 06:18:06,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1482 flow [2024-12-02 06:18:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-12-02 06:18:06,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689922480620154 [2024-12-02 06:18:06,899 INFO L175 Difference]: Start difference. First operand has 706 places, 724 transitions, 1462 flow. Second operand 3 states and 2250 transitions. [2024-12-02 06:18:06,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1482 flow [2024-12-02 06:18:06,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 723 transitions, 1472 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 06:18:06,910 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2024-12-02 06:18:06,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2024-12-02 06:18:06,912 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -16 predicate places. [2024-12-02 06:18:06,912 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2024-12-02 06:18:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 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 06:18:06,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:06,914 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] [2024-12-02 06:18:06,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 06:18:06,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:06,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash 103713176, now seen corresponding path program 1 times [2024-12-02 06:18:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:06,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120985436] [2024-12-02 06:18:06,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:06,966 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 06:18:06,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120985436] [2024-12-02 06:18:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120985436] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578604180] [2024-12-02 06:18:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:06,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:06,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:06,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-12-02 06:18:06,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 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 06:18:06,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:06,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-12-02 06:18:06,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:07,279 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2024-12-02 06:18:07,279 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2024-12-02 06:18:07,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1274 events. 59/1274 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5949 event pairs, 2 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1167. Up to 27 conditions per place. [2024-12-02 06:18:07,299 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-12-02 06:18:07,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1485 flow [2024-12-02 06:18:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-12-02 06:18:07,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-12-02 06:18:07,305 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2248 transitions. [2024-12-02 06:18:07,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1485 flow [2024-12-02 06:18:07,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:07,321 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2024-12-02 06:18:07,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2024-12-02 06:18:07,322 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2024-12-02 06:18:07,323 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2024-12-02 06:18:07,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 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 06:18:07,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:07,325 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] [2024-12-02 06:18:07,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 06:18:07,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:07,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash -711552444, now seen corresponding path program 1 times [2024-12-02 06:18:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:07,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364187317] [2024-12-02 06:18:07,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:07,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:07,397 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 06:18:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364187317] [2024-12-02 06:18:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364187317] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765855489] [2024-12-02 06:18:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:07,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:07,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:07,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:07,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:07,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:07,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:07,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:07,829 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2024-12-02 06:18:07,829 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2024-12-02 06:18:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1273 events. 65/1273 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5980 event pairs, 13 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2024-12-02 06:18:07,852 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2024-12-02 06:18:07,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2024-12-02 06:18:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-12-02 06:18:07,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-12-02 06:18:07,858 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2024-12-02 06:18:07,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2024-12-02 06:18:07,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:07,874 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2024-12-02 06:18:07,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2024-12-02 06:18:07,875 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2024-12-02 06:18:07,875 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2024-12-02 06:18:07,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:07,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:07,878 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] [2024-12-02 06:18:07,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 06:18:07,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:07,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1024278956, now seen corresponding path program 1 times [2024-12-02 06:18:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433069093] [2024-12-02 06:18:07,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:07,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:07,933 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 06:18:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433069093] [2024-12-02 06:18:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433069093] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26827673] [2024-12-02 06:18:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:07,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:07,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:07,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-12-02 06:18:07,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 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 06:18:07,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:07,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-12-02 06:18:07,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:08,178 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2024-12-02 06:18:08,179 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-12-02 06:18:08,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 998 events. 47/998 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3609 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2024-12-02 06:18:08,189 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2024-12-02 06:18:08,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2024-12-02 06:18:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-12-02 06:18:08,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-12-02 06:18:08,191 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2024-12-02 06:18:08,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2024-12-02 06:18:08,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:08,199 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2024-12-02 06:18:08,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=699, PETRI_TRANSITIONS=720} [2024-12-02 06:18:08,200 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2024-12-02 06:18:08,200 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2024-12-02 06:18:08,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 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 06:18:08,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:08,201 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] [2024-12-02 06:18:08,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 06:18:08,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2101460573, now seen corresponding path program 1 times [2024-12-02 06:18:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708240915] [2024-12-02 06:18:08,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:08,240 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 06:18:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708240915] [2024-12-02 06:18:08,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708240915] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:08,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:08,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125168210] [2024-12-02 06:18:08,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:08,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:08,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:08,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:08,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-12-02 06:18:08,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 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 06:18:08,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:08,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-12-02 06:18:08,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:08,952 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2024-12-02 06:18:08,952 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-12-02 06:18:08,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 5332 events. 383/5332 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 40998 event pairs, 100 based on Foata normal form. 0/4262 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2024-12-02 06:18:08,983 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2024-12-02 06:18:08,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2024-12-02 06:18:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-12-02 06:18:08,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-12-02 06:18:08,986 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2024-12-02 06:18:08,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2024-12-02 06:18:08,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:08,996 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2024-12-02 06:18:08,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=690, PETRI_TRANSITIONS=712} [2024-12-02 06:18:08,997 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2024-12-02 06:18:08,997 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2024-12-02 06:18:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 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 06:18:08,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:08,998 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] [2024-12-02 06:18:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 06:18:08,998 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:08,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash 869037951, now seen corresponding path program 1 times [2024-12-02 06:18:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066781798] [2024-12-02 06:18:08,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:09,034 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 06:18:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066781798] [2024-12-02 06:18:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066781798] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619448122] [2024-12-02 06:18:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:09,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-12-02 06:18:09,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 712 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 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 06:18:09,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:09,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-12-02 06:18:09,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:09,736 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2024-12-02 06:18:09,736 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-12-02 06:18:09,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 5526 events. 398/5526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43159 event pairs, 100 based on Foata normal form. 0/4483 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2024-12-02 06:18:09,766 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2024-12-02 06:18:09,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2024-12-02 06:18:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-12-02 06:18:09,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-12-02 06:18:09,768 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2024-12-02 06:18:09,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2024-12-02 06:18:09,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 06:18:09,776 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2024-12-02 06:18:09,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=683, PETRI_TRANSITIONS=704} [2024-12-02 06:18:09,778 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2024-12-02 06:18:09,778 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2024-12-02 06:18:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 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 06:18:09,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:09,779 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] [2024-12-02 06:18:09,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 06:18:09,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1728926341, now seen corresponding path program 1 times [2024-12-02 06:18:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121619289] [2024-12-02 06:18:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:09,827 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 06:18:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121619289] [2024-12-02 06:18:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121619289] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:09,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:09,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360575388] [2024-12-02 06:18:09,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:09,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:09,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:09,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:09,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:09,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 704 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 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 06:18:09,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:09,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:10,102 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2024-12-02 06:18:10,102 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-12-02 06:18:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1465 events. 79/1465 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7743 event pairs, 2 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2024-12-02 06:18:10,110 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2024-12-02 06:18:10,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2024-12-02 06:18:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-12-02 06:18:10,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-12-02 06:18:10,112 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2024-12-02 06:18:10,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2024-12-02 06:18:10,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 06:18:10,117 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2024-12-02 06:18:10,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2024-12-02 06:18:10,118 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2024-12-02 06:18:10,118 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2024-12-02 06:18:10,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 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 06:18:10,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:10,119 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] [2024-12-02 06:18:10,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 06:18:10,119 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -551507349, now seen corresponding path program 1 times [2024-12-02 06:18:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312968928] [2024-12-02 06:18:10,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:10,157 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 06:18:10,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312968928] [2024-12-02 06:18:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312968928] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:10,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:10,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:10,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428905971] [2024-12-02 06:18:10,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:10,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:10,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:10,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:10,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:10,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-12-02 06:18:10,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:10,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:10,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-12-02 06:18:10,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:10,521 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2024-12-02 06:18:10,521 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-12-02 06:18:10,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2291 events. 116/2291 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12461 event pairs, 4 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2024-12-02 06:18:10,535 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2024-12-02 06:18:10,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2024-12-02 06:18:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-12-02 06:18:10,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9595176571920758 [2024-12-02 06:18:10,538 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2024-12-02 06:18:10,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2024-12-02 06:18:10,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:10,545 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2024-12-02 06:18:10,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=679, PETRI_TRANSITIONS=701} [2024-12-02 06:18:10,546 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-12-02 06:18:10,546 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2024-12-02 06:18:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 06:18:10,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:10,546 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] [2024-12-02 06:18:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 06:18:10,547 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1733378458, now seen corresponding path program 1 times [2024-12-02 06:18:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:10,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341387891] [2024-12-02 06:18:10,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:10,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:10,594 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 06:18:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341387891] [2024-12-02 06:18:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341387891] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399092323] [2024-12-02 06:18:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:10,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:10,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:10,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:10,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 701 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 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 06:18:10,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:10,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:10,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:11,044 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2024-12-02 06:18:11,044 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2024-12-02 06:18:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 2245 events. 112/2245 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14441 event pairs, 10 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2024-12-02 06:18:11,064 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2024-12-02 06:18:11,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2024-12-02 06:18:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-12-02 06:18:11,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646856158484065 [2024-12-02 06:18:11,067 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2024-12-02 06:18:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2024-12-02 06:18:11,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 06:18:11,075 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2024-12-02 06:18:11,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=679, PETRI_TRANSITIONS=700} [2024-12-02 06:18:11,076 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-12-02 06:18:11,076 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2024-12-02 06:18:11,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 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 06:18:11,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:11,076 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] [2024-12-02 06:18:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 06:18:11,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 527119404, now seen corresponding path program 1 times [2024-12-02 06:18:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338836796] [2024-12-02 06:18:11,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:11,109 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 06:18:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338836796] [2024-12-02 06:18:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338836796] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430266419] [2024-12-02 06:18:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:11,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:11,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:11,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-12-02 06:18:11,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 700 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 0 states have call successors, (0), 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 06:18:11,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:11,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-12-02 06:18:11,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:11,348 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2024-12-02 06:18:11,348 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-12-02 06:18:11,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1484 events. 76/1484 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7801 event pairs, 7 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2024-12-02 06:18:11,360 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2024-12-02 06:18:11,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2024-12-02 06:18:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-12-02 06:18:11,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959086993970715 [2024-12-02 06:18:11,364 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2024-12-02 06:18:11,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2024-12-02 06:18:11,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:11,372 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2024-12-02 06:18:11,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=674, PETRI_TRANSITIONS=685} [2024-12-02 06:18:11,373 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2024-12-02 06:18:11,373 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2024-12-02 06:18:11,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 0 states have call successors, (0), 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 06:18:11,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:11,374 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] [2024-12-02 06:18:11,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 06:18:11,374 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 986153850, now seen corresponding path program 1 times [2024-12-02 06:18:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756856755] [2024-12-02 06:18:11,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:11,405 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 06:18:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:11,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756856755] [2024-12-02 06:18:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756856755] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:11,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261838364] [2024-12-02 06:18:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:11,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:11,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:11,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:11,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:11,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 685 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:18:11,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:11,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:11,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:11,652 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2024-12-02 06:18:11,653 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2024-12-02 06:18:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1468 events. 75/1468 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7623 event pairs, 10 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1419. Up to 67 conditions per place. [2024-12-02 06:18:11,664 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2024-12-02 06:18:11,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2024-12-02 06:18:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:18:11,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:18:11,669 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:18:11,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2024-12-02 06:18:11,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 06:18:11,680 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2024-12-02 06:18:11,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1445, PETRI_PLACES=662, PETRI_TRANSITIONS=684} [2024-12-02 06:18:11,680 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-12-02 06:18:11,681 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2024-12-02 06:18:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:18:11,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:11,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:18:11,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 06:18:11,682 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash -562303117, now seen corresponding path program 1 times [2024-12-02 06:18:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509388599] [2024-12-02 06:18:11,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:11,722 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 06:18:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509388599] [2024-12-02 06:18:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509388599] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:18:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701230174] [2024-12-02 06:18:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:11,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:11,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:11,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:11,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-12-02 06:18:11,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 684 transitions, 1445 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 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 06:18:11,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:11,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-12-02 06:18:11,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:12,550 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2024-12-02 06:18:12,550 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-12-02 06:18:12,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 4868 events. 227/4868 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41600 event pairs, 12 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2024-12-02 06:18:12,581 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2024-12-02 06:18:12,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2024-12-02 06:18:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2024-12-02 06:18:12,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970714900947459 [2024-12-02 06:18:12,588 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2024-12-02 06:18:12,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2024-12-02 06:18:12,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:12,598 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2024-12-02 06:18:12,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=664, PETRI_TRANSITIONS=688} [2024-12-02 06:18:12,599 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-12-02 06:18:12,599 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2024-12-02 06:18:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 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 06:18:12,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:12,600 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] [2024-12-02 06:18:12,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 06:18:12,600 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:12,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2076146351, now seen corresponding path program 1 times [2024-12-02 06:18:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102678930] [2024-12-02 06:18:12,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:12,632 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 06:18:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:12,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102678930] [2024-12-02 06:18:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102678930] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:12,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612231582] [2024-12-02 06:18:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:12,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:12,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:12,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:12,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-12-02 06:18:12,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 688 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 0 states have call successors, (0), 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 06:18:12,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:12,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-12-02 06:18:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:13,724 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2024-12-02 06:18:13,724 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-12-02 06:18:13,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 6361 events. 317/6361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56128 event pairs, 15 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2024-12-02 06:18:13,761 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2024-12-02 06:18:13,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2024-12-02 06:18:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-12-02 06:18:13,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-12-02 06:18:13,763 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2024-12-02 06:18:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2024-12-02 06:18:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 06:18:13,770 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2024-12-02 06:18:13,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2024-12-02 06:18:13,771 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:18:13,771 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2024-12-02 06:18:13,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 0 states have call successors, (0), 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 06:18:13,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:13,771 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] [2024-12-02 06:18:13,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 06:18:13,771 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:13,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1227535886, now seen corresponding path program 1 times [2024-12-02 06:18:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233721135] [2024-12-02 06:18:13,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:13,801 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 06:18:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233721135] [2024-12-02 06:18:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233721135] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442363101] [2024-12-02 06:18:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:13,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:13,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:13,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:13,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 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 06:18:13,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:13,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:13,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:14,810 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2024-12-02 06:18:14,811 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-12-02 06:18:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 6252 events. 298/6252 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 60232 event pairs, 32 based on Foata normal form. 0/5301 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2024-12-02 06:18:14,868 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2024-12-02 06:18:14,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2024-12-02 06:18:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:18:14,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:18:14,872 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:18:14,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2024-12-02 06:18:14,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:14,880 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2024-12-02 06:18:14,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=658, PETRI_TRANSITIONS=683} [2024-12-02 06:18:14,881 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-12-02 06:18:14,881 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2024-12-02 06:18:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 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 06:18:14,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:14,882 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] [2024-12-02 06:18:14,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 06:18:14,882 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash -629664846, now seen corresponding path program 1 times [2024-12-02 06:18:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736717086] [2024-12-02 06:18:14,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:14,926 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 06:18:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736717086] [2024-12-02 06:18:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736717086] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747328177] [2024-12-02 06:18:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:14,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:14,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:14,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-12-02 06:18:14,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 683 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 0 states have call successors, (0), 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 06:18:14,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:14,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-12-02 06:18:14,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:15,985 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2024-12-02 06:18:15,985 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2024-12-02 06:18:16,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 5797 events. 318/5797 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55895 event pairs, 16 based on Foata normal form. 0/4977 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2024-12-02 06:18:16,056 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2024-12-02 06:18:16,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2024-12-02 06:18:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-12-02 06:18:16,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-12-02 06:18:16,127 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2024-12-02 06:18:16,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2024-12-02 06:18:16,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:16,133 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2024-12-02 06:18:16,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2024-12-02 06:18:16,134 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2024-12-02 06:18:16,134 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2024-12-02 06:18:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 0 states have call successors, (0), 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 06:18:16,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:16,135 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 06:18:16,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 06:18:16,135 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 663718086, now seen corresponding path program 1 times [2024-12-02 06:18:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92058819] [2024-12-02 06:18:16,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:16,163 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 06:18:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92058819] [2024-12-02 06:18:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92058819] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561553905] [2024-12-02 06:18:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:16,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:16,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:16,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:18:16,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 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 06:18:16,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:16,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:18:16,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:17,451 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2024-12-02 06:18:17,452 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2024-12-02 06:18:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 5767 events. 300/5767 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55045 event pairs, 35 based on Foata normal form. 0/4963 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2024-12-02 06:18:17,514 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2024-12-02 06:18:17,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2024-12-02 06:18:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:18:17,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:18:17,519 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:18:17,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2024-12-02 06:18:17,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:17,530 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2024-12-02 06:18:17,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=678} [2024-12-02 06:18:17,531 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2024-12-02 06:18:17,531 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2024-12-02 06:18:17,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 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 06:18:17,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:17,531 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] [2024-12-02 06:18:17,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 06:18:17,531 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:17,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2071009915, now seen corresponding path program 1 times [2024-12-02 06:18:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295131027] [2024-12-02 06:18:17,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:17,576 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 06:18:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295131027] [2024-12-02 06:18:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295131027] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:17,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547027178] [2024-12-02 06:18:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:17,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:17,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:17,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:17,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:17,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 678 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 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 06:18:17,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:17,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:17,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:18,785 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2024-12-02 06:18:18,785 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-12-02 06:18:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 5685 events. 263/5685 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54355 event pairs, 9 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2024-12-02 06:18:18,833 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-12-02 06:18:18,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2024-12-02 06:18:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-12-02 06:18:18,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-12-02 06:18:18,836 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2024-12-02 06:18:18,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2024-12-02 06:18:18,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:18,842 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2024-12-02 06:18:18,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=647, PETRI_TRANSITIONS=674} [2024-12-02 06:18:18,842 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2024-12-02 06:18:18,842 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2024-12-02 06:18:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 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 06:18:18,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:18,843 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] [2024-12-02 06:18:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 06:18:18,844 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:18,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2045536528, now seen corresponding path program 1 times [2024-12-02 06:18:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:18,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50859910] [2024-12-02 06:18:18,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:18,878 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 06:18:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50859910] [2024-12-02 06:18:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50859910] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529963071] [2024-12-02 06:18:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:18,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:18,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:18,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:18,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 674 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:18:18,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:18,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:18,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:19,782 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2024-12-02 06:18:19,782 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-12-02 06:18:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 5673 events. 291/5673 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 53516 event pairs, 12 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2024-12-02 06:18:19,817 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-12-02 06:18:19,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2024-12-02 06:18:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-12-02 06:18:19,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-12-02 06:18:19,820 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2024-12-02 06:18:19,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2024-12-02 06:18:19,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:19,825 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2024-12-02 06:18:19,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=643, PETRI_TRANSITIONS=670} [2024-12-02 06:18:19,826 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-12-02 06:18:19,826 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2024-12-02 06:18:19,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:18:19,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:19,827 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] [2024-12-02 06:18:19,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 06:18:19,827 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 612823764, now seen corresponding path program 1 times [2024-12-02 06:18:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958259552] [2024-12-02 06:18:19,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:19,859 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 06:18:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958259552] [2024-12-02 06:18:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958259552] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903377934] [2024-12-02 06:18:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:19,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:19,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:19,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:19,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:19,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-12-02 06:18:19,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 670 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:18:19,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:19,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-12-02 06:18:19,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:21,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,320 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-12-02 06:18:21,320 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,320 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-12-02 06:18:21,320 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,321 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-12-02 06:18:21,321 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-12-02 06:18:21,321 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-12-02 06:18:21,321 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-12-02 06:18:21,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,323 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-12-02 06:18:21,323 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,323 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-12-02 06:18:21,323 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,332 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-12-02 06:18:21,332 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-12-02 06:18:21,332 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-12-02 06:18:21,332 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,350 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,350 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,350 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,351 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,351 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,351 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,353 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:21,353 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,353 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:21,353 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,354 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:21,354 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,355 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,355 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:21,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,362 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-12-02 06:18:21,362 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,362 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,362 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,364 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-12-02 06:18:21,364 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:21,364 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,364 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-12-02 06:18:21,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,381 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-12-02 06:18:21,381 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,381 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-12-02 06:18:21,381 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-12-02 06:18:21,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 504#L108-4true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,382 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-12-02 06:18:21,382 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:21,382 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 06:18:21,382 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:21,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,384 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-12-02 06:18:21,384 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:21,384 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:21,384 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 06:18:21,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 504#L108-4true, 407#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:21,392 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-12-02 06:18:21,392 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-12-02 06:18:21,392 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:21,392 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-12-02 06:18:21,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,450 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-12-02 06:18:21,450 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-12-02 06:18:21,450 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-12-02 06:18:21,450 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-12-02 06:18:21,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,451 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-12-02 06:18:21,451 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-12-02 06:18:21,451 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-12-02 06:18:21,451 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-12-02 06:18:21,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,459 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-12-02 06:18:21,459 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-12-02 06:18:21,459 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-12-02 06:18:21,459 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 829#true, 617#L76-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,468 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][518], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,468 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-12-02 06:18:21,468 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-12-02 06:18:21,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-12-02 06:18:21,475 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-12-02 06:18:21,475 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2024-12-02 06:18:21,475 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-12-02 06:18:21,475 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-12-02 06:18:21,539 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2024-12-02 06:18:21,539 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-12-02 06:18:21,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 10661 events. 565/10661 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 107636 event pairs, 22 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2024-12-02 06:18:21,632 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2024-12-02 06:18:21,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2024-12-02 06:18:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-12-02 06:18:21,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-12-02 06:18:21,634 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2024-12-02 06:18:21,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2024-12-02 06:18:21,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:21,641 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2024-12-02 06:18:21,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=642, PETRI_TRANSITIONS=670} [2024-12-02 06:18:21,642 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2024-12-02 06:18:21,642 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2024-12-02 06:18:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:18:21,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:21,643 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 06:18:21,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 06:18:21,643 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:21,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -872907179, now seen corresponding path program 1 times [2024-12-02 06:18:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104586865] [2024-12-02 06:18:21,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:21,678 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 06:18:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104586865] [2024-12-02 06:18:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104586865] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386065482] [2024-12-02 06:18:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:21,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:21,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:21,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:21,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:21,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 670 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:18:21,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:21,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:21,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:23,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:23,332 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:23,332 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:23,332 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:23,417 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1822] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:23,417 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:23,417 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:24,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:24,120 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-12-02 06:18:24,120 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:24,120 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-12-02 06:18:24,120 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-12-02 06:18:24,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:24,156 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:24,156 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:24,156 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:24,156 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:24,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:24,157 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:24,157 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:24,157 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:24,157 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:24,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 504#L108-4true, 847#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:24,192 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-12-02 06:18:24,192 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:24,192 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:24,192 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 06:18:24,375 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2024-12-02 06:18:24,376 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-12-02 06:18:24,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17503 conditions, 15546 events. 706/15546 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 173754 event pairs, 63 based on Foata normal form. 0/13771 useless extension candidates. Maximal degree in co-relation 16427. Up to 356 conditions per place. [2024-12-02 06:18:24,515 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-12-02 06:18:24,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2024-12-02 06:18:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:18:24,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:18:24,518 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:18:24,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2024-12-02 06:18:24,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 06:18:24,529 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2024-12-02 06:18:24,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=643, PETRI_TRANSITIONS=669} [2024-12-02 06:18:24,530 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-12-02 06:18:24,530 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2024-12-02 06:18:24,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:18:24,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:24,531 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 06:18:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 06:18:24,531 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1443272931, now seen corresponding path program 1 times [2024-12-02 06:18:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968502273] [2024-12-02 06:18:24,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:24,622 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 06:18:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968502273] [2024-12-02 06:18:24,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968502273] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:24,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:18:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842952501] [2024-12-02 06:18:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:24,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:18:24,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:24,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:18:24,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:18:24,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-12-02 06:18:24,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 669 transitions, 1505 flow. Second operand has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 0 states have call successors, (0), 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 06:18:24,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:24,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-12-02 06:18:24,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:26,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,171 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-12-02 06:18:26,171 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:26,172 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 06:18:26,172 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-12-02 06:18:26,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,204 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-12-02 06:18:26,204 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:26,204 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 06:18:26,204 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-12-02 06:18:26,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,599 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2024-12-02 06:18:26,599 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-12-02 06:18:26,599 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-12-02 06:18:26,599 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-12-02 06:18:26,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,611 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-12-02 06:18:26,611 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-12-02 06:18:26,611 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-12-02 06:18:26,611 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-12-02 06:18:26,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,613 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-12-02 06:18:26,613 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-12-02 06:18:26,613 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-12-02 06:18:26,613 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-12-02 06:18:26,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 504#L108-4true, 847#true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:26,625 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2024-12-02 06:18:26,625 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-12-02 06:18:26,625 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-12-02 06:18:26,625 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-12-02 06:18:26,692 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2024-12-02 06:18:26,692 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-12-02 06:18:26,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 10013 events. 463/10013 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 92234 event pairs, 26 based on Foata normal form. 0/8837 useless extension candidates. Maximal degree in co-relation 11011. Up to 159 conditions per place. [2024-12-02 06:18:26,833 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2024-12-02 06:18:26,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2024-12-02 06:18:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:18:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 06:18:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2024-12-02 06:18:26,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695090439276486 [2024-12-02 06:18:26,835 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2024-12-02 06:18:26,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2024-12-02 06:18:26,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:26,844 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2024-12-02 06:18:26,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1545, PETRI_PLACES=648, PETRI_TRANSITIONS=673} [2024-12-02 06:18:26,845 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2024-12-02 06:18:26,845 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2024-12-02 06:18:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 0 states have call successors, (0), 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 06:18:26,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:26,845 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 06:18:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 06:18:26,845 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -695903301, now seen corresponding path program 1 times [2024-12-02 06:18:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553831796] [2024-12-02 06:18:26,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:26,931 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 06:18:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553831796] [2024-12-02 06:18:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553831796] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:18:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110960480] [2024-12-02 06:18:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 06:18:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:26,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 06:18:26,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 06:18:26,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-12-02 06:18:26,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 673 transitions, 1545 flow. Second operand has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 0 states have call successors, (0), 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 06:18:26,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:26,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-12-02 06:18:26,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:28,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,440 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-12-02 06:18:28,440 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-12-02 06:18:28,440 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-12-02 06:18:28,440 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-12-02 06:18:28,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,470 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-12-02 06:18:28,470 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-12-02 06:18:28,470 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-12-02 06:18:28,471 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-12-02 06:18:28,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,856 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2024-12-02 06:18:28,856 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-12-02 06:18:28,856 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-12-02 06:18:28,856 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-12-02 06:18:28,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,868 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-12-02 06:18:28,868 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-12-02 06:18:28,868 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-12-02 06:18:28,868 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-12-02 06:18:28,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,870 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-12-02 06:18:28,870 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-12-02 06:18:28,870 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-12-02 06:18:28,870 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-12-02 06:18:28,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 504#L108-4true, 850#true, 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:28,882 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2024-12-02 06:18:28,882 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-12-02 06:18:28,882 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-12-02 06:18:28,882 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-12-02 06:18:28,950 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2024-12-02 06:18:28,950 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2024-12-02 06:18:29,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 8981 events. 399/8981 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79775 event pairs, 14 based on Foata normal form. 1/7930 useless extension candidates. Maximal degree in co-relation 9793. Up to 159 conditions per place. [2024-12-02 06:18:29,086 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2024-12-02 06:18:29,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2024-12-02 06:18:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:18:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 06:18:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2024-12-02 06:18:29,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9674418604651163 [2024-12-02 06:18:29,089 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2024-12-02 06:18:29,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2024-12-02 06:18:29,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 06:18:29,097 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2024-12-02 06:18:29,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1565, PETRI_PLACES=653, PETRI_TRANSITIONS=674} [2024-12-02 06:18:29,098 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2024-12-02 06:18:29,098 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2024-12-02 06:18:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 0 states have call successors, (0), 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 06:18:29,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:29,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:18:29,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 06:18:29,099 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 898940270, now seen corresponding path program 1 times [2024-12-02 06:18:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456970648] [2024-12-02 06:18:29,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:18:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456970648] [2024-12-02 06:18:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456970648] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 06:18:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202946248] [2024-12-02 06:18:29,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:18:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 06:18:29,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 06:18:29,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 06:18:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:29,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 06:18:29,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 06:18:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:18:29,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 06:18:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 06:18:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202946248] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 06:18:29,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 06:18:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-12-02 06:18:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408828963] [2024-12-02 06:18:29,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 06:18:29,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 06:18:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:29,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 06:18:29,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-12-02 06:18:29,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-12-02 06:18:29,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 674 transitions, 1565 flow. Second operand has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 0 states have call successors, (0), 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 06:18:29,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:29,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-12-02 06:18:29,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:31,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,517 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-12-02 06:18:31,517 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-12-02 06:18:31,517 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-12-02 06:18:31,517 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-12-02 06:18:31,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,549 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-12-02 06:18:31,549 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-12-02 06:18:31,550 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-12-02 06:18:31,550 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-12-02 06:18:31,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,971 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-12-02 06:18:31,971 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-12-02 06:18:31,971 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-12-02 06:18:31,971 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-12-02 06:18:31,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,983 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-12-02 06:18:31,983 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:31,983 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-12-02 06:18:31,983 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:31,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,985 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-12-02 06:18:31,985 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:31,985 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:31,985 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-12-02 06:18:31,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:31,998 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-12-02 06:18:31,998 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-12-02 06:18:31,998 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-12-02 06:18:31,998 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-12-02 06:18:32,075 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2024-12-02 06:18:32,076 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2024-12-02 06:18:32,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 8998 events. 399/8998 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79869 event pairs, 14 based on Foata normal form. 2/7948 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2024-12-02 06:18:32,217 INFO L140 encePairwiseOnDemand]: 764/774 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2024-12-02 06:18:32,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2024-12-02 06:18:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 06:18:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 06:18:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2024-12-02 06:18:32,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630021141649049 [2024-12-02 06:18:32,222 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2024-12-02 06:18:32,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2024-12-02 06:18:32,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 06:18:32,231 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2024-12-02 06:18:32,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2024-12-02 06:18:32,232 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2024-12-02 06:18:32,232 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2024-12-02 06:18:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 0 states have call successors, (0), 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 06:18:32,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:32,233 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] [2024-12-02 06:18:32,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 06:18:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 06:18:32,434 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1574369842, now seen corresponding path program 2 times [2024-12-02 06:18:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625740907] [2024-12-02 06:18:32,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 06:18:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:32,471 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 06:18:32,471 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 06:18:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625740907] [2024-12-02 06:18:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625740907] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:18:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10662000] [2024-12-02 06:18:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:18:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:18:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:18:32,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-12-02 06:18:32,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 0 states have call successors, (0), 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 06:18:32,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:32,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-12-02 06:18:32,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:34,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:34,824 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-12-02 06:18:34,824 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-12-02 06:18:34,825 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-12-02 06:18:34,825 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-12-02 06:18:34,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 612#L55-1true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:34,853 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-12-02 06:18:34,853 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-12-02 06:18:34,853 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-12-02 06:18:34,853 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-12-02 06:18:35,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:35,241 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-12-02 06:18:35,241 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-12-02 06:18:35,241 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-12-02 06:18:35,241 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-12-02 06:18:35,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:35,252 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-12-02 06:18:35,252 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:35,252 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-12-02 06:18:35,252 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:35,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:35,254 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-12-02 06:18:35,254 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:35,254 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-12-02 06:18:35,254 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-12-02 06:18:35,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2099] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 504#L108-4true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 612#L55-1true, 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 383#L76-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-12-02 06:18:35,266 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-12-02 06:18:35,266 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-12-02 06:18:35,266 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-12-02 06:18:35,266 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-12-02 06:18:35,335 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2024-12-02 06:18:35,335 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-12-02 06:18:35,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 10030 events. 473/10030 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 92148 event pairs, 17 based on Foata normal form. 0/8886 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2024-12-02 06:18:35,440 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2024-12-02 06:18:35,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2024-12-02 06:18:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:18:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 06:18:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-12-02 06:18:35,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-12-02 06:18:35,443 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2024-12-02 06:18:35,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2024-12-02 06:18:35,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-12-02 06:18:35,452 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2024-12-02 06:18:35,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=664, PETRI_TRANSITIONS=679} [2024-12-02 06:18:35,453 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-12-02 06:18:35,453 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2024-12-02 06:18:35,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 0 states have call successors, (0), 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 06:18:35,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:35,454 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] [2024-12-02 06:18:35,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 06:18:35,455 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:35,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash -487513711, now seen corresponding path program 1 times [2024-12-02 06:18:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:35,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369978807] [2024-12-02 06:18:35,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369978807] [2024-12-02 06:18:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369978807] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 06:18:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872360119] [2024-12-02 06:18:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 06:18:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:35,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 06:18:35,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 06:18:35,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-12-02 06:18:35,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 679 transitions, 1613 flow. Second operand has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 0 states have call successors, (0), 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 06:18:35,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:35,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-12-02 06:18:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:38,749 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2024-12-02 06:18:38,749 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-12-02 06:18:38,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 12848 events. 649/12848 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 126944 event pairs, 42 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2024-12-02 06:18:38,893 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2024-12-02 06:18:38,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2024-12-02 06:18:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 06:18:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 06:18:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2024-12-02 06:18:38,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969250645994832 [2024-12-02 06:18:38,896 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2024-12-02 06:18:38,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2024-12-02 06:18:38,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 06:18:38,904 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2024-12-02 06:18:38,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=683} [2024-12-02 06:18:38,905 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-12-02 06:18:38,905 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2024-12-02 06:18:38,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 0 states have call successors, (0), 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 06:18:38,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:38,906 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] [2024-12-02 06:18:38,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 06:18:38,906 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1491273475, now seen corresponding path program 1 times [2024-12-02 06:18:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11776987] [2024-12-02 06:18:38,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11776987] [2024-12-02 06:18:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11776987] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752317305] [2024-12-02 06:18:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:38,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:38,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 683 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:18:38,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:38,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:41,699 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2024-12-02 06:18:41,700 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2024-12-02 06:18:41,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 12842 events. 731/12842 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 129554 event pairs, 103 based on Foata normal form. 0/11329 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2024-12-02 06:18:41,809 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2024-12-02 06:18:41,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2024-12-02 06:18:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:18:41,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:18:41,812 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:18:41,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2024-12-02 06:18:41,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 06:18:41,823 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2024-12-02 06:18:41,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2024-12-02 06:18:41,824 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2024-12-02 06:18:41,824 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2024-12-02 06:18:41,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:18:41,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:41,825 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] [2024-12-02 06:18:41,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 06:18:41,825 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1158886635, now seen corresponding path program 1 times [2024-12-02 06:18:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998147709] [2024-12-02 06:18:41,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998147709] [2024-12-02 06:18:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998147709] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287306393] [2024-12-02 06:18:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:41,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:41,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:41,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-12-02 06:18:41,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 0 states have call successors, (0), 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 06:18:41,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:41,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-12-02 06:18:41,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:44,846 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2024-12-02 06:18:44,846 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-12-02 06:18:44,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13549 conditions, 11726 events. 567/11726 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110211 event pairs, 52 based on Foata normal form. 0/10408 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2024-12-02 06:18:44,992 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2024-12-02 06:18:44,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2024-12-02 06:18:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-12-02 06:18:44,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-12-02 06:18:44,995 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2024-12-02 06:18:44,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2024-12-02 06:18:45,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:45,006 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2024-12-02 06:18:45,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=681} [2024-12-02 06:18:45,007 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-12-02 06:18:45,007 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2024-12-02 06:18:45,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 0 states have call successors, (0), 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 06:18:45,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:45,007 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] [2024-12-02 06:18:45,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 06:18:45,008 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:45,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1736515266, now seen corresponding path program 1 times [2024-12-02 06:18:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646672847] [2024-12-02 06:18:45,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646672847] [2024-12-02 06:18:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646672847] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:45,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:45,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 06:18:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686189550] [2024-12-02 06:18:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:45,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 06:18:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:45,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 06:18:45,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 06:18:45,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-12-02 06:18:45,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 681 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 0 states have call successors, (0), 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 06:18:45,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:45,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-12-02 06:18:45,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:48,610 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2024-12-02 06:18:48,610 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2024-12-02 06:18:48,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 12757 events. 670/12757 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 127086 event pairs, 30 based on Foata normal form. 0/11365 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2024-12-02 06:18:48,798 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2024-12-02 06:18:48,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2024-12-02 06:18:48,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 06:18:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 06:18:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-12-02 06:18:48,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-12-02 06:18:48,801 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2024-12-02 06:18:48,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2024-12-02 06:18:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:48,810 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2024-12-02 06:18:48,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=680} [2024-12-02 06:18:48,811 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2024-12-02 06:18:48,811 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2024-12-02 06:18:48,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 0 states have call successors, (0), 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 06:18:48,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:48,811 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] [2024-12-02 06:18:48,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 06:18:48,812 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:48,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1774963750, now seen corresponding path program 1 times [2024-12-02 06:18:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077295725] [2024-12-02 06:18:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077295725] [2024-12-02 06:18:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077295725] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:48,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:48,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744306173] [2024-12-02 06:18:48,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:48,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:48,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:48,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:48,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-12-02 06:18:48,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 680 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:18:48,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:48,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-12-02 06:18:48,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:52,454 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2024-12-02 06:18:52,454 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2024-12-02 06:18:52,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 13672 events. 653/13672 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 130440 event pairs, 26 based on Foata normal form. 0/12248 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2024-12-02 06:18:52,573 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-12-02 06:18:52,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2024-12-02 06:18:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2024-12-02 06:18:52,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659776055124892 [2024-12-02 06:18:52,576 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2024-12-02 06:18:52,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2024-12-02 06:18:52,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 06:18:52,591 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2024-12-02 06:18:52,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=677} [2024-12-02 06:18:52,592 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-12-02 06:18:52,592 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2024-12-02 06:18:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:18:52,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:52,593 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] [2024-12-02 06:18:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 06:18:52,593 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:52,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1953064777, now seen corresponding path program 1 times [2024-12-02 06:18:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390251994] [2024-12-02 06:18:52,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390251994] [2024-12-02 06:18:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390251994] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720587862] [2024-12-02 06:18:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:52,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:52,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:52,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-12-02 06:18:52,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 677 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 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 06:18:52,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:52,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-12-02 06:18:52,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:55,902 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2024-12-02 06:18:55,902 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2024-12-02 06:18:55,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 12102 events. 687/12102 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 120762 event pairs, 82 based on Foata normal form. 0/10846 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2024-12-02 06:18:56,029 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2024-12-02 06:18:56,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2024-12-02 06:18:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-12-02 06:18:56,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-12-02 06:18:56,031 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2024-12-02 06:18:56,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2024-12-02 06:18:56,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 06:18:56,039 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2024-12-02 06:18:56,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=676} [2024-12-02 06:18:56,040 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-12-02 06:18:56,040 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2024-12-02 06:18:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 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 06:18:56,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:56,040 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] [2024-12-02 06:18:56,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 06:18:56,041 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:56,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -882789554, now seen corresponding path program 1 times [2024-12-02 06:18:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130250482] [2024-12-02 06:18:56,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130250482] [2024-12-02 06:18:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130250482] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945951272] [2024-12-02 06:18:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:56,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:56,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:56,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:56,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-12-02 06:18:56,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 676 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 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 06:18:56,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:56,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-12-02 06:18:56,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:18:59,088 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2024-12-02 06:18:59,088 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2024-12-02 06:18:59,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 11895 events. 693/11895 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 118791 event pairs, 30 based on Foata normal form. 0/10840 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2024-12-02 06:18:59,197 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-12-02 06:18:59,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2024-12-02 06:18:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:18:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:18:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-12-02 06:18:59,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-12-02 06:18:59,198 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2024-12-02 06:18:59,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2024-12-02 06:18:59,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:18:59,208 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2024-12-02 06:18:59,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=659, PETRI_TRANSITIONS=673} [2024-12-02 06:18:59,209 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:18:59,209 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2024-12-02 06:18:59,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 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 06:18:59,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:18:59,209 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] [2024-12-02 06:18:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 06:18:59,209 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:18:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:18:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1663872136, now seen corresponding path program 1 times [2024-12-02 06:18:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:18:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565263197] [2024-12-02 06:18:59,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:18:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:18:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:18:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:18:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:18:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565263197] [2024-12-02 06:18:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565263197] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:18:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:18:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:18:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844031738] [2024-12-02 06:18:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:18:59,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:18:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:18:59,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:18:59,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:18:59,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:18:59,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 673 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:18:59,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:18:59,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:18:59,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:03,020 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2024-12-02 06:19:03,020 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-12-02 06:19:03,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 17128 events. 825/17128 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 177830 event pairs, 75 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2024-12-02 06:19:03,203 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-12-02 06:19:03,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2024-12-02 06:19:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:19:03,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:19:03,205 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:19:03,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2024-12-02 06:19:03,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 06:19:03,218 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2024-12-02 06:19:03,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-12-02 06:19:03,218 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:19:03,218 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2024-12-02 06:19:03,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:19:03,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:03,219 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] [2024-12-02 06:19:03,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 06:19:03,219 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -912190852, now seen corresponding path program 1 times [2024-12-02 06:19:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71515785] [2024-12-02 06:19:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71515785] [2024-12-02 06:19:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71515785] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:03,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088090506] [2024-12-02 06:19:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:03,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:03,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:03,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:03,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:19:03,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:19:03,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:03,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:19:03,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:06,215 INFO L124 PetriNetUnfolderBase]: 747/12382 cut-off events. [2024-12-02 06:19:06,215 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2024-12-02 06:19:06,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15075 conditions, 12382 events. 747/12382 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 124628 event pairs, 110 based on Foata normal form. 0/11349 useless extension candidates. Maximal degree in co-relation 14851. Up to 645 conditions per place. [2024-12-02 06:19:06,363 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-12-02 06:19:06,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1684 flow [2024-12-02 06:19:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:19:06,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:19:06,365 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:19:06,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1684 flow [2024-12-02 06:19:06,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:06,378 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2024-12-02 06:19:06,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-12-02 06:19:06,379 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-12-02 06:19:06,379 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2024-12-02 06:19:06,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:19:06,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:06,380 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] [2024-12-02 06:19:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 06:19:06,380 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash 765293268, now seen corresponding path program 1 times [2024-12-02 06:19:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313494728] [2024-12-02 06:19:06,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313494728] [2024-12-02 06:19:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313494728] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:06,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313383581] [2024-12-02 06:19:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:06,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:19:06,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 0 states have call successors, (0), 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 06:19:06,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:06,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:19:06,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:10,514 INFO L124 PetriNetUnfolderBase]: 871/18314 cut-off events. [2024-12-02 06:19:10,514 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2024-12-02 06:19:10,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21607 conditions, 18314 events. 871/18314 cut-off events. For 466/468 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 191455 event pairs, 66 based on Foata normal form. 0/16865 useless extension candidates. Maximal degree in co-relation 21383. Up to 451 conditions per place. [2024-12-02 06:19:10,691 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-12-02 06:19:10,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2024-12-02 06:19:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:19:10,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:19:10,693 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:19:10,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2024-12-02 06:19:10,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:10,711 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2024-12-02 06:19:10,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2024-12-02 06:19:10,712 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-12-02 06:19:10,712 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2024-12-02 06:19:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 0 states have call successors, (0), 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 06:19:10,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:10,713 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] [2024-12-02 06:19:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 06:19:10,713 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1223230088, now seen corresponding path program 1 times [2024-12-02 06:19:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054381274] [2024-12-02 06:19:10,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054381274] [2024-12-02 06:19:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054381274] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615183860] [2024-12-02 06:19:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:10,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:10,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:10,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:19:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 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 06:19:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:19:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:13,954 INFO L124 PetriNetUnfolderBase]: 743/12362 cut-off events. [2024-12-02 06:19:13,954 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2024-12-02 06:19:14,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14951 conditions, 12362 events. 743/12362 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 124818 event pairs, 118 based on Foata normal form. 0/11372 useless extension candidates. Maximal degree in co-relation 14727. Up to 648 conditions per place. [2024-12-02 06:19:14,086 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-12-02 06:19:14,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 670 transitions, 1688 flow [2024-12-02 06:19:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:19:14,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:19:14,089 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:19:14,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 670 transitions, 1688 flow [2024-12-02 06:19:14,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 670 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:14,097 INFO L231 Difference]: Finished difference. Result has 656 places, 669 transitions, 1637 flow [2024-12-02 06:19:14,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=656, PETRI_TRANSITIONS=669} [2024-12-02 06:19:14,098 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -62 predicate places. [2024-12-02 06:19:14,098 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 669 transitions, 1637 flow [2024-12-02 06:19:14,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 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 06:19:14,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:14,098 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] [2024-12-02 06:19:14,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 06:19:14,099 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1099488804, now seen corresponding path program 1 times [2024-12-02 06:19:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149815372] [2024-12-02 06:19:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149815372] [2024-12-02 06:19:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149815372] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:19:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586342984] [2024-12-02 06:19:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:14,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:14,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:14,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:14,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-12-02 06:19:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 669 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:19:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-12-02 06:19:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:17,357 INFO L124 PetriNetUnfolderBase]: 557/11430 cut-off events. [2024-12-02 06:19:17,358 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2024-12-02 06:19:17,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 11430 events. 557/11430 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102720 event pairs, 40 based on Foata normal form. 0/10545 useless extension candidates. Maximal degree in co-relation 13179. Up to 205 conditions per place. [2024-12-02 06:19:17,468 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-12-02 06:19:17,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 672 transitions, 1670 flow [2024-12-02 06:19:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-12-02 06:19:17,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-12-02 06:19:17,470 INFO L175 Difference]: Start difference. First operand has 656 places, 669 transitions, 1637 flow. Second operand 3 states and 2258 transitions. [2024-12-02 06:19:17,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 672 transitions, 1670 flow [2024-12-02 06:19:17,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 672 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:17,478 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2024-12-02 06:19:17,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-12-02 06:19:17,479 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-12-02 06:19:17,479 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2024-12-02 06:19:17,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:19:17,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:17,480 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] [2024-12-02 06:19:17,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 06:19:17,480 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:17,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:17,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1559865432, now seen corresponding path program 1 times [2024-12-02 06:19:17,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:17,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381704171] [2024-12-02 06:19:17,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:17,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381704171] [2024-12-02 06:19:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381704171] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300796738] [2024-12-02 06:19:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:17,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:19:17,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:19:17,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:17,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:19:17,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:21,657 INFO L124 PetriNetUnfolderBase]: 911/19053 cut-off events. [2024-12-02 06:19:21,657 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-12-02 06:19:21,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 19053 events. 911/19053 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 198158 event pairs, 71 based on Foata normal form. 0/17655 useless extension candidates. Maximal degree in co-relation 22212. Up to 430 conditions per place. [2024-12-02 06:19:21,785 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-12-02 06:19:21,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1694 flow [2024-12-02 06:19:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:19:21,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:19:21,786 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:19:21,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1694 flow [2024-12-02 06:19:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:21,794 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1651 flow [2024-12-02 06:19:21,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2024-12-02 06:19:21,795 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-12-02 06:19:21,795 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1651 flow [2024-12-02 06:19:21,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 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 06:19:21,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:21,795 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] [2024-12-02 06:19:21,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 06:19:21,796 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:21,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1702557592, now seen corresponding path program 1 times [2024-12-02 06:19:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381812407] [2024-12-02 06:19:21,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381812407] [2024-12-02 06:19:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381812407] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:21,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:19:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709079521] [2024-12-02 06:19:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:21,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:21,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:21,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:21,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-12-02 06:19:21,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 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 06:19:21,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:21,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-12-02 06:19:21,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:24,433 INFO L124 PetriNetUnfolderBase]: 631/11740 cut-off events. [2024-12-02 06:19:24,433 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2024-12-02 06:19:24,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 11740 events. 631/11740 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 114546 event pairs, 59 based on Foata normal form. 0/10819 useless extension candidates. Maximal degree in co-relation 13747. Up to 317 conditions per place. [2024-12-02 06:19:24,516 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-12-02 06:19:24,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1684 flow [2024-12-02 06:19:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-12-02 06:19:24,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-12-02 06:19:24,518 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1651 flow. Second operand 3 states and 2258 transitions. [2024-12-02 06:19:24,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1684 flow [2024-12-02 06:19:24,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:24,524 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2024-12-02 06:19:24,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-12-02 06:19:24,524 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:19:24,524 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2024-12-02 06:19:24,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 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 06:19:24,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:24,525 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 06:19:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 06:19:24,525 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1831336260, now seen corresponding path program 1 times [2024-12-02 06:19:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:24,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371310099] [2024-12-02 06:19:24,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371310099] [2024-12-02 06:19:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371310099] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678009358] [2024-12-02 06:19:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:24,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:24,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:24,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-12-02 06:19:24,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 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 06:19:24,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:24,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-12-02 06:19:24,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:27,243 INFO L124 PetriNetUnfolderBase]: 747/12434 cut-off events. [2024-12-02 06:19:27,244 INFO L125 PetriNetUnfolderBase]: For 759/763 co-relation queries the response was YES. [2024-12-02 06:19:27,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 12434 events. 747/12434 cut-off events. For 759/763 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 126010 event pairs, 102 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 15242. Up to 613 conditions per place. [2024-12-02 06:19:27,392 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-12-02 06:19:27,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1708 flow [2024-12-02 06:19:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-12-02 06:19:27,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-12-02 06:19:27,393 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2237 transitions. [2024-12-02 06:19:27,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1708 flow [2024-12-02 06:19:27,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:27,401 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1665 flow [2024-12-02 06:19:27,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1665, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-12-02 06:19:27,402 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-12-02 06:19:27,402 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1665 flow [2024-12-02 06:19:27,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 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 06:19:27,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:27,402 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 06:19:27,402 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1264693862, now seen corresponding path program 1 times [2024-12-02 06:19:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446565182] [2024-12-02 06:19:27,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446565182] [2024-12-02 06:19:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446565182] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:19:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107050512] [2024-12-02 06:19:27,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:27,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:27,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:27,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:27,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-12-02 06:19:27,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1665 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:19:27,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:27,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-12-02 06:19:27,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:29,813 INFO L124 PetriNetUnfolderBase]: 557/11576 cut-off events. [2024-12-02 06:19:29,813 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-12-02 06:19:29,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13858 conditions, 11576 events. 557/11576 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 103312 event pairs, 40 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 13633. Up to 205 conditions per place. [2024-12-02 06:19:29,960 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2024-12-02 06:19:29,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1698 flow [2024-12-02 06:19:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-12-02 06:19:29,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-12-02 06:19:29,961 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1665 flow. Second operand 3 states and 2258 transitions. [2024-12-02 06:19:29,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1698 flow [2024-12-02 06:19:29,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1692 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:29,970 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1681 flow [2024-12-02 06:19:29,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-12-02 06:19:29,970 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2024-12-02 06:19:29,970 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1681 flow [2024-12-02 06:19:29,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 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 06:19:29,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:29,971 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 06:19:29,971 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:29,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1711593750, now seen corresponding path program 1 times [2024-12-02 06:19:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642808195] [2024-12-02 06:19:29,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:30,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642808195] [2024-12-02 06:19:30,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642808195] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:30,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:30,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328546484] [2024-12-02 06:19:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:30,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:30,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:30,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:30,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:19:30,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1681 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:19:30,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:30,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:19:30,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:34,222 INFO L124 PetriNetUnfolderBase]: 1079/23272 cut-off events. [2024-12-02 06:19:34,222 INFO L125 PetriNetUnfolderBase]: For 436/438 co-relation queries the response was YES. [2024-12-02 06:19:34,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 23272 events. 1079/23272 cut-off events. For 436/438 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 253706 event pairs, 68 based on Foata normal form. 0/21765 useless extension candidates. Maximal degree in co-relation 27594. Up to 565 conditions per place. [2024-12-02 06:19:34,430 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 22 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-12-02 06:19:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1730 flow [2024-12-02 06:19:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:19:34,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:19:34,432 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1681 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:19:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1730 flow [2024-12-02 06:19:34,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:34,442 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1677 flow [2024-12-02 06:19:34,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-12-02 06:19:34,443 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:19:34,443 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1677 flow [2024-12-02 06:19:34,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 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 06:19:34,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:34,443 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:34,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-02 06:19:34,443 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:34,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1770169639, now seen corresponding path program 1 times [2024-12-02 06:19:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273479892] [2024-12-02 06:19:34,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:34,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273479892] [2024-12-02 06:19:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273479892] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:34,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 06:19:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286914985] [2024-12-02 06:19:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:34,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:34,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:34,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-12-02 06:19:34,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 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 06:19:34,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:34,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-12-02 06:19:34,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:37,071 INFO L124 PetriNetUnfolderBase]: 623/11884 cut-off events. [2024-12-02 06:19:37,071 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2024-12-02 06:19:37,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14445 conditions, 11884 events. 623/11884 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 115460 event pairs, 59 based on Foata normal form. 0/11074 useless extension candidates. Maximal degree in co-relation 14219. Up to 317 conditions per place. [2024-12-02 06:19:37,220 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-12-02 06:19:37,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1710 flow [2024-12-02 06:19:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-12-02 06:19:37,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-12-02 06:19:37,221 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1677 flow. Second operand 3 states and 2258 transitions. [2024-12-02 06:19:37,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1710 flow [2024-12-02 06:19:37,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:37,229 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1695 flow [2024-12-02 06:19:37,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2024-12-02 06:19:37,230 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -57 predicate places. [2024-12-02 06:19:37,230 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1695 flow [2024-12-02 06:19:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 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 06:19:37,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:37,230 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:37,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-12-02 06:19:37,230 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:37,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1280667637, now seen corresponding path program 1 times [2024-12-02 06:19:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404929302] [2024-12-02 06:19:37,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404929302] [2024-12-02 06:19:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404929302] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416276609] [2024-12-02 06:19:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:37,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:37,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:37,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-12-02 06:19:37,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:19:37,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:37,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-12-02 06:19:37,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:39,830 INFO L124 PetriNetUnfolderBase]: 773/12756 cut-off events. [2024-12-02 06:19:39,830 INFO L125 PetriNetUnfolderBase]: For 755/759 co-relation queries the response was YES. [2024-12-02 06:19:39,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16245 conditions, 12756 events. 773/12756 cut-off events. For 755/759 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 130732 event pairs, 122 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 16017. Up to 694 conditions per place. [2024-12-02 06:19:39,969 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 22 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-12-02 06:19:39,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1744 flow [2024-12-02 06:19:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-12-02 06:19:39,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-12-02 06:19:39,971 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1695 flow. Second operand 3 states and 2235 transitions. [2024-12-02 06:19:39,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1744 flow [2024-12-02 06:19:39,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:39,979 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1691 flow [2024-12-02 06:19:39,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-12-02 06:19:39,979 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2024-12-02 06:19:39,979 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1691 flow [2024-12-02 06:19:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 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 06:19:39,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:39,980 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:39,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-02 06:19:39,980 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:39,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1421647088, now seen corresponding path program 1 times [2024-12-02 06:19:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952559581] [2024-12-02 06:19:39,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952559581] [2024-12-02 06:19:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952559581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:40,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103209] [2024-12-02 06:19:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:40,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:40,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:40,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:40,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-12-02 06:19:40,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 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 06:19:40,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:40,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-12-02 06:19:40,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:42,417 INFO L124 PetriNetUnfolderBase]: 549/11548 cut-off events. [2024-12-02 06:19:42,417 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-12-02 06:19:42,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14090 conditions, 11548 events. 549/11548 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 107288 event pairs, 41 based on Foata normal form. 0/10900 useless extension candidates. Maximal degree in co-relation 13862. Up to 223 conditions per place. [2024-12-02 06:19:42,551 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-12-02 06:19:42,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1720 flow [2024-12-02 06:19:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-12-02 06:19:42,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-12-02 06:19:42,553 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1691 flow. Second operand 3 states and 2247 transitions. [2024-12-02 06:19:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1720 flow [2024-12-02 06:19:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:42,561 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1689 flow [2024-12-02 06:19:42,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1689, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-12-02 06:19:42,562 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-12-02 06:19:42,562 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1689 flow [2024-12-02 06:19:42,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 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 06:19:42,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 06:19:42,562 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:42,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-02 06:19:42,562 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-12-02 06:19:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 06:19:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 45462545, now seen corresponding path program 1 times [2024-12-02 06:19:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 06:19:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414647848] [2024-12-02 06:19:42,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 06:19:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 06:19:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 06:19:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-02 06:19:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 06:19:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414647848] [2024-12-02 06:19:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414647848] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 06:19:42,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 06:19:42,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 06:19:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264153555] [2024-12-02 06:19:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 06:19:42,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 06:19:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 06:19:42,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 06:19:42,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 06:19:42,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-12-02 06:19:42,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1689 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 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 06:19:42,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 06:19:42,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-12-02 06:19:42,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 06:19:45,525 INFO L124 PetriNetUnfolderBase]: 659/12626 cut-off events. [2024-12-02 06:19:45,525 INFO L125 PetriNetUnfolderBase]: For 200/204 co-relation queries the response was YES. [2024-12-02 06:19:45,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15460 conditions, 12626 events. 659/12626 cut-off events. For 200/204 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 123180 event pairs, 70 based on Foata normal form. 0/11904 useless extension candidates. Maximal degree in co-relation 15232. Up to 307 conditions per place. [2024-12-02 06:19:45,615 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 0 selfloop transitions, 0 changer transitions 672/672 dead transitions. [2024-12-02 06:19:45,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1718 flow [2024-12-02 06:19:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 06:19:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 06:19:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-12-02 06:19:45,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-12-02 06:19:45,617 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1689 flow. Second operand 3 states and 2247 transitions. [2024-12-02 06:19:45,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1718 flow [2024-12-02 06:19:45,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1714 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 06:19:45,622 INFO L231 Difference]: Finished difference. Result has 658 places, 0 transitions, 0 flow [2024-12-02 06:19:45,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=658, PETRI_TRANSITIONS=0} [2024-12-02 06:19:45,623 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-12-02 06:19:45,623 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 0 transitions, 0 flow [2024-12-02 06:19:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 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 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (189 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (188 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (187 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (186 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (185 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (184 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (183 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (182 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (181 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (180 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (179 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (178 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (177 of 190 remaining) [2024-12-02 06:19:45,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (176 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (175 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (174 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (173 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (172 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (171 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (170 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (169 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (168 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (167 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (166 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (165 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (164 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (163 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (162 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (161 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (160 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (159 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (158 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (157 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (156 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (155 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (154 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (153 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (152 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (151 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (150 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (149 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (148 of 190 remaining) [2024-12-02 06:19:45,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (147 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (146 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (145 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (144 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (143 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (142 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (141 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (140 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (139 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (138 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (137 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (136 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (135 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (134 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (133 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (132 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (131 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (130 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (129 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (128 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (127 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (126 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (124 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (123 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (122 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (121 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (120 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (119 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (118 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (117 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (116 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (115 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (114 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (113 of 190 remaining) [2024-12-02 06:19:45,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (112 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (111 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (110 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (109 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (108 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (107 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (106 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (105 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (104 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (102 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (101 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (100 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (99 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (98 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (97 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (95 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (94 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (93 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (92 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (91 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (90 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (89 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (85 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 190 remaining) [2024-12-02 06:19:45,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (75 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (73 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (72 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (71 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (70 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (69 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (68 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (67 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (66 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (65 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (60 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (59 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (58 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (56 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (55 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (54 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (52 of 190 remaining) [2024-12-02 06:19:45,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (51 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (50 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (49 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (48 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (47 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (46 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (45 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (44 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (43 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (36 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (33 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (32 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (31 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (30 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (28 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (27 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (26 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (25 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (24 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (23 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (22 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 190 remaining) [2024-12-02 06:19:45,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (9 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (8 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (4 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (3 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 190 remaining) [2024-12-02 06:19:45,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 190 remaining) [2024-12-02 06:19:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-02 06:19:45,631 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 06:19:45,636 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 06:19:45,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 06:19:45,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:19:45 BasicIcfg [2024-12-02 06:19:45,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 06:19:45,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 06:19:45,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 06:19:45,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 06:19:45,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:17:59" (3/4) ... [2024-12-02 06:19:45,643 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-02 06:19:45,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-12-02 06:19:45,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-12-02 06:19:45,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-12-02 06:19:45,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-02 06:19:45,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-02 06:19:45,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-02 06:19:45,713 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 06:19:45,713 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 06:19:45,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 06:19:45,714 INFO L158 Benchmark]: Toolchain (without parser) took 107241.44ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 118.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 827.0MB. Max. memory is 16.1GB. [2024-12-02 06:19:45,714 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:19:45,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.40ms. Allocated memory is still 142.6MB. Free memory was 118.3MB in the beginning and 104.2MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:19:45,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.29ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 101.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:19:45,715 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 98.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 06:19:45,715 INFO L158 Benchmark]: RCFGBuilder took 861.53ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 107.8MB in the end (delta: -9.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-12-02 06:19:45,715 INFO L158 Benchmark]: TraceAbstraction took 105941.90ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 107.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-12-02 06:19:45,716 INFO L158 Benchmark]: Witness Printer took 71.77ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 06:19:45,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.40ms. Allocated memory is still 142.6MB. Free memory was 118.3MB in the beginning and 104.2MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.29ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 101.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 98.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 861.53ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 107.8MB in the end (delta: -9.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 105941.90ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 107.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 71.77ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1258 locations, 190 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 105.8s, OverallIterations: 56, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 100.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3353 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1229 mSDsluCounter, 857 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3575 IncrementalHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 652 mSDtfsCounter, 3575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=53, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 11001 NumberOfCodeBlocks, 10956 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 11159 ConstructedInterpolants, 0 QuantifiedInterpolants, 12186 SizeOfPredicates, 5 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 1257/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 102 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-12-02 06:19:45,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb17b474-f21c-40e3-a0e6-34679bdca9ca/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE